Pub Date : 2019-03-01DOI: 10.1109/SPIN.2019.8711774
R. Kumar, N. Kumar, K. Jung
This paper proposes a novel data hiding method using adaptive quantization & dynamic bit plane based AMBTC technique. In the proposed method, initially, a cover image is partitioned into a set of non-overlapping blocks, then adaptive number of quantization levels and size of the bit-plane for each block is determined, using the complexity level. The secret data is concealed into the bit-planes of the blocks according to their tolerance capability. The secret data is embedded via simple bit replacement strategy. The dynamic categorization of image blocks and determination of number of quantization levels along with the size of bit-planes have significantly contributed in providing high quality marked-image while maintain the same bit-rate. Further, the proposed scheme provides high data hiding capacity as almost every block is being used for hiding the secret data. It is clearly evident from the experimental results that proposed method performs significantly better than the conventional AMBTC based data hiding methods for the hiding capacity and image quality trade-off, without any change in required bit-rate.
{"title":"A New Data Hiding Method Using Adaptive Quantization & Dynamic Bit Plane Based AMBTC","authors":"R. Kumar, N. Kumar, K. Jung","doi":"10.1109/SPIN.2019.8711774","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711774","url":null,"abstract":"This paper proposes a novel data hiding method using adaptive quantization & dynamic bit plane based AMBTC technique. In the proposed method, initially, a cover image is partitioned into a set of non-overlapping blocks, then adaptive number of quantization levels and size of the bit-plane for each block is determined, using the complexity level. The secret data is concealed into the bit-planes of the blocks according to their tolerance capability. The secret data is embedded via simple bit replacement strategy. The dynamic categorization of image blocks and determination of number of quantization levels along with the size of bit-planes have significantly contributed in providing high quality marked-image while maintain the same bit-rate. Further, the proposed scheme provides high data hiding capacity as almost every block is being used for hiding the secret data. It is clearly evident from the experimental results that proposed method performs significantly better than the conventional AMBTC based data hiding methods for the hiding capacity and image quality trade-off, without any change in required bit-rate.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129271731","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711578
Sandeepika Sharma, Brahmjit Singh
Platooning is one of the key applications of Intelligent Transportation System (ITS) for the smart cities. Various wireless technologies have been proposed for meeting the stringent requirements of platooning. 3GPP has initiated standardization work for LTE based V2V communication. It offers potential means to support transmission of safety critical messages among platoon vehicles with high reliability, security and ultra low latency. However, efficient resource allocation has been a challenge in LTE based networks. In this paper, we propose a Cooperative-Reinforcement Learning (C-RL) based resource selection algorithm for communication among connected vehicles utilizing LTE-Direct technology. The proposal outperforms the distributed resource selection scheme in terms of actual time required for Cooperative Awareness Messages (CAM) dissemination among vehicles forming the platoon and performance of other vehicular links sharing the similar Resource Blocks (RBs). Simulation results shows the efficacy of the proposed algorithm in terms of efficient resource utilization and faster dissemination of messages among the connected vehicles.
{"title":"Cooperative Reinforcement Learning Based Adaptive Resource Allocation in V2V Communication","authors":"Sandeepika Sharma, Brahmjit Singh","doi":"10.1109/SPIN.2019.8711578","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711578","url":null,"abstract":"Platooning is one of the key applications of Intelligent Transportation System (ITS) for the smart cities. Various wireless technologies have been proposed for meeting the stringent requirements of platooning. 3GPP has initiated standardization work for LTE based V2V communication. It offers potential means to support transmission of safety critical messages among platoon vehicles with high reliability, security and ultra low latency. However, efficient resource allocation has been a challenge in LTE based networks. In this paper, we propose a Cooperative-Reinforcement Learning (C-RL) based resource selection algorithm for communication among connected vehicles utilizing LTE-Direct technology. The proposal outperforms the distributed resource selection scheme in terms of actual time required for Cooperative Awareness Messages (CAM) dissemination among vehicles forming the platoon and performance of other vehicular links sharing the similar Resource Blocks (RBs). Simulation results shows the efficacy of the proposed algorithm in terms of efficient resource utilization and faster dissemination of messages among the connected vehicles.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115262603","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 : 2019-03-01DOI: 10.1109/spin.2019.8711790
2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)
2019第六届信号处理与集成网络国际会议(SPIN)
{"title":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","authors":"","doi":"10.1109/spin.2019.8711790","DOIUrl":"https://doi.org/10.1109/spin.2019.8711790","url":null,"abstract":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125242927","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711713
Smita Singhal, Anu Mehra, U. Tripathi
In this paper, a new technique of power reduction in a cmos domino logic is proposed. The proposed technique uses clock gating as well as output hold circuitery. Clock is passed to the domino logic only during the active state of the circuit. During standby mode, clock is bypassed while the state of the circuit is retained. A 2:1 multiplexer is used for clock gating and for retaining the state of the circuit. Simulation results are being carried out in a 2-input nand gate, 2-input nor gate and 1-bit conventional full adder cell in 16nm cmos technology. The power of the proposed circuit is reduced to an average of 99.37 percent with respect to standard domino logic. Propagation delay is slightly increased to an average of 4.53 percent. Area of the proposed circuit increases to four transistors per domino module.
{"title":"Power Reduction in Domino Logic Using Clock Gating in 16nm CMOS Technology","authors":"Smita Singhal, Anu Mehra, U. Tripathi","doi":"10.1109/SPIN.2019.8711713","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711713","url":null,"abstract":"In this paper, a new technique of power reduction in a cmos domino logic is proposed. The proposed technique uses clock gating as well as output hold circuitery. Clock is passed to the domino logic only during the active state of the circuit. During standby mode, clock is bypassed while the state of the circuit is retained. A 2:1 multiplexer is used for clock gating and for retaining the state of the circuit. Simulation results are being carried out in a 2-input nand gate, 2-input nor gate and 1-bit conventional full adder cell in 16nm cmos technology. The power of the proposed circuit is reduced to an average of 99.37 percent with respect to standard domino logic. Propagation delay is slightly increased to an average of 4.53 percent. Area of the proposed circuit increases to four transistors per domino module.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863732","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711695
V. Arya, Nikhil Pachauri
The objective of this paper is to design a closed loop control scheme for optimal drug scheduling during chemotherapy. For this purpose, a PID controller is designed and implemented to regulate drug concentration and toxicity. Whale optimization technique is used to evaluate the design parameter values of PID controller leading to, WOA-PID. Further simulated annealing tuned PID (SA-PID) is also designed for comparison purpose. Simulation results reveals that WOA-PID provide effective drug scheduling during chemotherapy in comparison to SA-PID.
{"title":"PID Based Chemotherapeutic Drug Scheduling for Cancer Treatment","authors":"V. Arya, Nikhil Pachauri","doi":"10.1109/SPIN.2019.8711695","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711695","url":null,"abstract":"The objective of this paper is to design a closed loop control scheme for optimal drug scheduling during chemotherapy. For this purpose, a PID controller is designed and implemented to regulate drug concentration and toxicity. Whale optimization technique is used to evaluate the design parameter values of PID controller leading to, WOA-PID. Further simulated annealing tuned PID (SA-PID) is also designed for comparison purpose. Simulation results reveals that WOA-PID provide effective drug scheduling during chemotherapy in comparison to SA-PID.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"782 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132546448","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711651
Mukul Majhi, Jitesh Pradhan, Arup Kumar Pal
In this paper, an efficient content based image retrieval scheme is proposed which incorporates the security of images in a retrieval system. The main contribution of the proposed scheme is two folded that is to develop an efficient image retrieval process, and to provide security to the retrieved images. To achieve this goal, features from the foreground region as well as background features are extracted, where more importance is given to the foreground region which is identified based on Itti Koch Saliency Map. From the obtained foreground region texture features along with color features are extracted. Simultaneously, the background is divided into four regions and color features are extracted. Finally, the foreground and background features are combined to perform image retrieval process. Now to prevent the feature vector from illegitimate users, suitable cryptographic approaches are used to provide security in terms of confidentiality and integrity. To protect the integrity, the hash value of the feature vector is computed and the obtained hash value along with feature vector are enciphered together. This enciphered value is then communicated to the user. The content owner verifies the integrity of the feature and performs the retrieval process. The retrieved results are then watermarked to protect copyright and are further enciphered so that unauthorized user's cannot access the images. This security mechanism ensures that the retrieved images are shared only to the authorized user. The retrieval process is performed on Corel dataset and the results are comparable to the existing state-of-arts methods. Finally, this process is suitable to protect the security of images in a retrieval system.
{"title":"An Efficient Content Based Image Retrieval Scheme with Preserving the Security of Images*","authors":"Mukul Majhi, Jitesh Pradhan, Arup Kumar Pal","doi":"10.1109/SPIN.2019.8711651","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711651","url":null,"abstract":"In this paper, an efficient content based image retrieval scheme is proposed which incorporates the security of images in a retrieval system. The main contribution of the proposed scheme is two folded that is to develop an efficient image retrieval process, and to provide security to the retrieved images. To achieve this goal, features from the foreground region as well as background features are extracted, where more importance is given to the foreground region which is identified based on Itti Koch Saliency Map. From the obtained foreground region texture features along with color features are extracted. Simultaneously, the background is divided into four regions and color features are extracted. Finally, the foreground and background features are combined to perform image retrieval process. Now to prevent the feature vector from illegitimate users, suitable cryptographic approaches are used to provide security in terms of confidentiality and integrity. To protect the integrity, the hash value of the feature vector is computed and the obtained hash value along with feature vector are enciphered together. This enciphered value is then communicated to the user. The content owner verifies the integrity of the feature and performs the retrieval process. The retrieved results are then watermarked to protect copyright and are further enciphered so that unauthorized user's cannot access the images. This security mechanism ensures that the retrieved images are shared only to the authorized user. The retrieval process is performed on Corel dataset and the results are comparable to the existing state-of-arts methods. Finally, this process is suitable to protect the security of images in a retrieval system.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893966","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711630
D. Sharma, A. Sai Sabitha
India is a country in which agriculture plays a wide role with around 70% of its population is dependent on agriculture good in direct or indirect way. The agricultural sector contributes about 14% to GDP of India. As the population is increasing, demand for crops is also increasing day by day. About all suicides in India farmer suicide accounts for 11.2%. There are many reasons given for farmer suicides like inadequate monsoon rainfall, interest rate is high, certain government policies are not in welfare, mental health issues, personal and family problems. It is also noticed that even the states are responsible for manipulating certain statistics. this research work uses data mining clustering technique to group attributes that results in low crop production. Case studies are conducted to map and co-relate the low crop production, monsoon factors along with farmer suicidal data. The states are affected most is identified and further analysed.
{"title":"Identification of Influential Factors for Productivity and Sustainability of Crops Using Data Mining Techniques","authors":"D. Sharma, A. Sai Sabitha","doi":"10.1109/SPIN.2019.8711630","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711630","url":null,"abstract":"India is a country in which agriculture plays a wide role with around 70% of its population is dependent on agriculture good in direct or indirect way. The agricultural sector contributes about 14% to GDP of India. As the population is increasing, demand for crops is also increasing day by day. About all suicides in India farmer suicide accounts for 11.2%. There are many reasons given for farmer suicides like inadequate monsoon rainfall, interest rate is high, certain government policies are not in welfare, mental health issues, personal and family problems. It is also noticed that even the states are responsible for manipulating certain statistics. this research work uses data mining clustering technique to group attributes that results in low crop production. Case studies are conducted to map and co-relate the low crop production, monsoon factors along with farmer suicidal data. The states are affected most is identified and further analysed.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115776271","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711618
R. Dhammi, K. M. Soni, S. Selvam, Prabhdyal Singh
This paper is about the use of thermocouples in wireless sensor networks using Java. Thermocouples are able to measure temperatures as high as 1200 degree Celsius. Standard implementation of thermocouples requires the use of peripheral hardware to measure temperature. Through this paper, it has been shown how Java can be used to interface the thermocouple directly with the Xbee radio modules using customized API, without using any peripheral hardware or microcontrollers. Real time data are stored and analyzed through graph.
{"title":"Real Time Monitoring of High Temperature of Remote Places Using Wireless Sensor Network Without use of any Peripheral Hardware","authors":"R. Dhammi, K. M. Soni, S. Selvam, Prabhdyal Singh","doi":"10.1109/SPIN.2019.8711618","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711618","url":null,"abstract":"This paper is about the use of thermocouples in wireless sensor networks using Java. Thermocouples are able to measure temperatures as high as 1200 degree Celsius. Standard implementation of thermocouples requires the use of peripheral hardware to measure temperature. Through this paper, it has been shown how Java can be used to interface the thermocouple directly with the Xbee radio modules using customized API, without using any peripheral hardware or microcontrollers. Real time data are stored and analyzed through graph.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"624 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123274827","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 : 2019-03-01DOI: 10.1109/SPIN.2019.8711674
Gurjot Kaur, D. Kakkar
Preliminary studies have discussed numerous diagnostic techniques for detection of Neurodevelopmental disorders (Autism Spectrum Disorder, Attention Deficit Hyperactivity Disorder, Learning Disabilities, Intellectual Disabilities etc). The fuzzy based-systems have also been proposed considering the heterogeneous nature of the disorders. But, these techniques are detecting the disorders individually and lack in detecting their co-morbidities. The present paper has considered the co-morbid factors along with the disorders ASD, ADHD and ID in individuals. The most distinguishing symptoms of these disorders are categorized into most affected areas such as social, emotional, behavioral and conceptual domains and fed to the Fuzzy Rule Based (FRB) system. This expert system has distinguished these disorders as well as their co-morbidities on a single platform. Hence, the present paper has provided an integrated approach to diagnose the co-morbidities and extremities leading to the variations in disorders.
{"title":"Fuzzy Based Integrated Diagnostic System for Neurodevelopmental Disorders","authors":"Gurjot Kaur, D. Kakkar","doi":"10.1109/SPIN.2019.8711674","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711674","url":null,"abstract":"Preliminary studies have discussed numerous diagnostic techniques for detection of Neurodevelopmental disorders (Autism Spectrum Disorder, Attention Deficit Hyperactivity Disorder, Learning Disabilities, Intellectual Disabilities etc). The fuzzy based-systems have also been proposed considering the heterogeneous nature of the disorders. But, these techniques are detecting the disorders individually and lack in detecting their co-morbidities. The present paper has considered the co-morbid factors along with the disorders ASD, ADHD and ID in individuals. The most distinguishing symptoms of these disorders are categorized into most affected areas such as social, emotional, behavioral and conceptual domains and fed to the Fuzzy Rule Based (FRB) system. This expert system has distinguished these disorders as well as their co-morbidities on a single platform. Hence, the present paper has provided an integrated approach to diagnose the co-morbidities and extremities leading to the variations in disorders.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123505390","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}
The problem of computing the reversal distance and determining a sequence of reversals to transform a genome in molecular biology is a powerful tool to derive relationships between genes. Given two signed permutations, we need to find the shortest sequence of reversals to transform one into another. The foremost polynomial-time algorithm to calculate the reversal distance used an overlap graph formed from the permutation to find connected components and then identified graph structures like hurdles. Previous researchers have used a Union-Find structure, an $mathbf{O}(mathbf{n}alpha(mathbf{n}))$ algorithm ($alpha$->inverse Ackerman function) to determine the connected components. A linear time algorithm for finding the connected components, which was a faster implementation of the existing works was proposed later. This algorithm is applied to an unsigned extension of the signed permutation. In the first scan, cycles in a breakpoint graph were located. Then in a second scan, an overlap forest is formed which gave all the connected components of the permutation. In this paper, we optimize the existing algorithm to construct the overlap forest by reducing a scan of the unsigned permutation.
{"title":"Sorting by Reversals: A Faster Approach for Building Overlap Forest","authors":"N. Garg, Manubhav Jain, Sugandha Singhania, Parinay Prateek, Prantik Biswas, Indu Chawla","doi":"10.1109/SPIN.2019.8711775","DOIUrl":"https://doi.org/10.1109/SPIN.2019.8711775","url":null,"abstract":"The problem of computing the reversal distance and determining a sequence of reversals to transform a genome in molecular biology is a powerful tool to derive relationships between genes. Given two signed permutations, we need to find the shortest sequence of reversals to transform one into another. The foremost polynomial-time algorithm to calculate the reversal distance used an overlap graph formed from the permutation to find connected components and then identified graph structures like hurdles. Previous researchers have used a Union-Find structure, an $mathbf{O}(mathbf{n}alpha(mathbf{n}))$ algorithm ($alpha$->inverse Ackerman function) to determine the connected components. A linear time algorithm for finding the connected components, which was a faster implementation of the existing works was proposed later. This algorithm is applied to an unsigned extension of the signed permutation. In the first scan, cycles in a breakpoint graph were located. Then in a second scan, an overlap forest is formed which gave all the connected components of the permutation. In this paper, we optimize the existing algorithm to construct the overlap forest by reducing a scan of the unsigned permutation.","PeriodicalId":344030,"journal":{"name":"2019 6th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121674228","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
扫码关注我们
求助内容：
应助结果提醒方式：