Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631722
Kin-Ping Hui, D. Phillips, Asanka Kekirigoda, A. Allwright
Military and humanitarian missions may occur in a wide variety of environments, they are often deployed in short time scales, and must be robust to a variety of challenges, both natural and man-made. In order to operate in such scenarios, organisations need flexible, robust and high performance communications systems. This paper presents the DST Group Opal system supporting a MANET incorporating ground vehicles, a UAV and high performance digital radios, in a real geographic environment. Measures of network connectivity and throughput were taken in conjunction with the physical response of network devices to benign and hostile challenges.
{"title":"Range Extension Using Opal in Open Environments","authors":"Kin-Ping Hui, D. Phillips, Asanka Kekirigoda, A. Allwright","doi":"10.1109/ICSPCS.2018.8631722","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631722","url":null,"abstract":"Military and humanitarian missions may occur in a wide variety of environments, they are often deployed in short time scales, and must be robust to a variety of challenges, both natural and man-made. In order to operate in such scenarios, organisations need flexible, robust and high performance communications systems. This paper presents the DST Group Opal system supporting a MANET incorporating ground vehicles, a UAV and high performance digital radios, in a real geographic environment. Measures of network connectivity and throughput were taken in conjunction with the physical response of network devices to benign and hostile challenges.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115154951","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631731
C. S. Rodriguez, M. Lech, E. Pirogova
With the ongoing expansion of digitized artworks, the automated analysis and categorization of fine art paintings have become a rapidly growing research field. However, due to the implicit subjectivity and nuances separating different artistic movements, numerical art analysis implies significant challenges. This paper describes a new efficient method that improves the classification accuracy of fine-art paintings compared to the existing baseline methods. The proposed approach is based on transfer learning and classification of sub-regions or patches of the painting. A weighted sum of the individual-patch classification outcomes gives the final stylistic label of the analyzed painting. The patch weights are optimized to maximize the overall style recognition accuracy. Experimental validation based on two standard art classification datasets and six different pre-trained convolutional neural network (CNN) models (AlexNet, VGG-16, VGG-19, GoogLeNet, ResNet-50 and Inceptionv3) shows that the proposed approach outperforms the baseline techniques and offers low computational and data costs.
{"title":"Classification of Style in Fine-Art Paintings Using Transfer Learning and Weighted Image Patches","authors":"C. S. Rodriguez, M. Lech, E. Pirogova","doi":"10.1109/ICSPCS.2018.8631731","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631731","url":null,"abstract":"With the ongoing expansion of digitized artworks, the automated analysis and categorization of fine art paintings have become a rapidly growing research field. However, due to the implicit subjectivity and nuances separating different artistic movements, numerical art analysis implies significant challenges. This paper describes a new efficient method that improves the classification accuracy of fine-art paintings compared to the existing baseline methods. The proposed approach is based on transfer learning and classification of sub-regions or patches of the painting. A weighted sum of the individual-patch classification outcomes gives the final stylistic label of the analyzed painting. The patch weights are optimized to maximize the overall style recognition accuracy. Experimental validation based on two standard art classification datasets and six different pre-trained convolutional neural network (CNN) models (AlexNet, VGG-16, VGG-19, GoogLeNet, ResNet-50 and Inceptionv3) shows that the proposed approach outperforms the baseline techniques and offers low computational and data costs.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132283868","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}
When airborne radar works on former mode, short-range clutter presents eyebrow shape curve and has the strong non-uniform, and clutter suppression is more difficult. Thus, the adaptive clutter suppression of forward-looking airborne radar for non-uniform clutter is a difficult question. Firstly, the use of a grid map method is taken for airborne radar forward-looking clutter model simulation analysis. Secondly, the forward-looking clutter suppression approach of airborne radar based on Knowledge-Aided Joint-Domain Localized (KA-JDL) algorithm of object filtering is proposed in this paper. Lastly, this new clutter suppression method is verified by the measured data. The experimental result shows that this method can suppress effectively the clutter compared with traditional JDL. It achieved a performance improvement of2-3dB.
{"title":"Forward-Looking Clutter Suppression Approach of Airborne Radar Based on KA-JDL Algorithm of Object Filtering","authors":"Dongmei Guo, Yajun Li, Zhuoqun Wang, Sheng Shao, Shuangshuang Li, Jinguo Xiao","doi":"10.1109/ICSPCS.2018.8631757","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631757","url":null,"abstract":"When airborne radar works on former mode, short-range clutter presents eyebrow shape curve and has the strong non-uniform, and clutter suppression is more difficult. Thus, the adaptive clutter suppression of forward-looking airborne radar for non-uniform clutter is a difficult question. Firstly, the use of a grid map method is taken for airborne radar forward-looking clutter model simulation analysis. Secondly, the forward-looking clutter suppression approach of airborne radar based on Knowledge-Aided Joint-Domain Localized (KA-JDL) algorithm of object filtering is proposed in this paper. Lastly, this new clutter suppression method is verified by the measured data. The experimental result shows that this method can suppress effectively the clutter compared with traditional JDL. It achieved a performance improvement of2-3dB.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115389692","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631756
T. Athauda, N. Karmakar
We present the design of four ring symmetric circular split ring resonators and four ring asymmetric circular split ring resonator designs as chipless RFID (Radio Frequency Identification) tags that can be used to accommodate data bits in ultra-wideband (UWB) frequencies. The compact proposed resonators are derived using split circular ring resonator design. Both simulated and fabricated results are presented and the suitability of each design for the respective fabrication techniques are also discussed.
{"title":"Optimization of Novel Chipless RFID tag Designs Using Different Fabrication Techniques in Ultra-Wideband","authors":"T. Athauda, N. Karmakar","doi":"10.1109/ICSPCS.2018.8631756","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631756","url":null,"abstract":"We present the design of four ring symmetric circular split ring resonators and four ring asymmetric circular split ring resonator designs as chipless RFID (Radio Frequency Identification) tags that can be used to accommodate data bits in ultra-wideband (UWB) frequencies. The compact proposed resonators are derived using split circular ring resonator design. Both simulated and fabricated results are presented and the suitability of each design for the respective fabrication techniques are also discussed.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124492982","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631768
T. Nakachi, Hiroyuki Ishihara, H. Kiya
The brain-machine interface (BMI) has attracted much attention in the fields of biomedical engineering and ICT human communications. Of particular interest, neural decoding methods have rapidly developed over the last decade in neuroscience, allowing us to estimate the contents of human perception and subjective mental states by capturing brain activity patterns. However, the development of neural decoding will generate significant concern about privacy violation. In this manuscript, we propose a secure network BMI decoding method based on sparse coding for a covert spatial attention task. It is shown that secure sparse coding enables us to not only protect observed EEG signals, but also achieve the same estimation performance as that offered by sparse coding with unprotected observed signals.
{"title":"Privacy-Preserving Network BMI Decoding of Covert Spatial Attention","authors":"T. Nakachi, Hiroyuki Ishihara, H. Kiya","doi":"10.1109/ICSPCS.2018.8631768","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631768","url":null,"abstract":"The brain-machine interface (BMI) has attracted much attention in the fields of biomedical engineering and ICT human communications. Of particular interest, neural decoding methods have rapidly developed over the last decade in neuroscience, allowing us to estimate the contents of human perception and subjective mental states by capturing brain activity patterns. However, the development of neural decoding will generate significant concern about privacy violation. In this manuscript, we propose a secure network BMI decoding method based on sparse coding for a covert spatial attention task. It is shown that secure sparse coding enables us to not only protect observed EEG signals, but also achieve the same estimation performance as that offered by sparse coding with unprotected observed signals.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129310137","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631785
Firouzeh Golaghazadeh, S. Coulombe, F. Coudoux, P. Corlay
In this paper, the concept of non-desynchronizing bits (NDBs) is defined in the context of H.264 video as a bit whose inversion does not cause desynchronization at the bitstream level or change the number of decoded macroblocks. We established that, on the whole, NDBs make up about a third (about 30 %) of a bitstream, and that their flipping effect on visual quality is mostly insignificant. In most cases (90 %), the PSNR value obtained when modifying an NDB is very close to the intact value. The performance of the proposed non-desync-based decoding framework, which retains a corrupted packet, under the condition of not causing desynchronization, has been compared to the JM-FC and a state-of-the-art concealment approach using the STBMA approach, and on average, respectively, provides 3.5 dB and 1.42 dB gain over them.
{"title":"The Impact of H.264 Non-Desynchronizing Bits on Visual Quality and its Application to Robust Video Decoding","authors":"Firouzeh Golaghazadeh, S. Coulombe, F. Coudoux, P. Corlay","doi":"10.1109/ICSPCS.2018.8631785","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631785","url":null,"abstract":"In this paper, the concept of non-desynchronizing bits (NDBs) is defined in the context of H.264 video as a bit whose inversion does not cause desynchronization at the bitstream level or change the number of decoded macroblocks. We established that, on the whole, NDBs make up about a third (about 30 %) of a bitstream, and that their flipping effect on visual quality is mostly insignificant. In most cases (90 %), the PSNR value obtained when modifying an NDB is very close to the intact value. The performance of the proposed non-desync-based decoding framework, which retains a corrupted packet, under the condition of not causing desynchronization, has been compared to the JM-FC and a state-of-the-art concealment approach using the STBMA approach, and on average, respectively, provides 3.5 dB and 1.42 dB gain over them.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131360573","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631741
M. Islam, K. Sithamparanathan, R. Evans
Underutilization of radio spectrum is being rehabilitated into resources with the dynamic configuration characteristics of cognitive radio. Upon detection of vacant channel, consensus of transmitter and receiver on one channel is precondition for data transmission which is termed as rendezvous. Blind and asymmetric views of channels necessitate a substantial cost on agreement of transmitter and receiver for attaining a common channel. In this paper, analytical views of statistical distribution with asymmetric channel for rendezvous are put into display. Upon analysis of statistical characteristics, the rendezvous times for different repetition rates and delays are obtained. Based on the analysis, we have perceived finest repetition rate for different point of views. Through Matlab simulations, it is demonstrated that, proper guaranteed consensus of channel within optimal time is ensured with statistical distribution over conventional system.
{"title":"Monte-Carlo Simulation Based Analysis of Sender-Jump Receiver-Wait Rendezvous Technique with Asymmetric Channels for Cognitive Networks","authors":"M. Islam, K. Sithamparanathan, R. Evans","doi":"10.1109/ICSPCS.2018.8631741","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631741","url":null,"abstract":"Underutilization of radio spectrum is being rehabilitated into resources with the dynamic configuration characteristics of cognitive radio. Upon detection of vacant channel, consensus of transmitter and receiver on one channel is precondition for data transmission which is termed as rendezvous. Blind and asymmetric views of channels necessitate a substantial cost on agreement of transmitter and receiver for attaining a common channel. In this paper, analytical views of statistical distribution with asymmetric channel for rendezvous are put into display. Upon analysis of statistical characteristics, the rendezvous times for different repetition rates and delays are obtained. Based on the analysis, we have perceived finest repetition rate for different point of views. Through Matlab simulations, it is demonstrated that, proper guaranteed consensus of channel within optimal time is ensured with statistical distribution over conventional system.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123812757","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631720
Thi Anh Le, Sol Park, Van Phu Tuan, H. Kong
In this paper, we analyze the performance of a non-orthogonal multiple access (NOMA) energy harvesting (EH) relaying system with the residual transmit RF impairments (RTRI) over a Rayleigh fading channel. Users in our proposed system are allocated with different power levels. The source node communicates with the near user using the direct link and communicates with the far user via an amplify-and-forward (AF) relay which uses the time-switching (TS) protocol to harvest energy from the source's signal. The near user also receives the signal broadcasted by the relay and uses this signal to improve its performance. To evaluate the performance of system, the expressions for outage probability (OP) and throughput are derived, and these analyses are verified by a Monte Carlo simulation. Moreover, the effects of various parameters, such as power allocation levels, target data rate, EH efficiency and transmit hardware impairment levels on the OP and throughput of proposed system are investigated.
{"title":"Performance Analysis of the Downlink NOMA EH Relaying Network with RTRI","authors":"Thi Anh Le, Sol Park, Van Phu Tuan, H. Kong","doi":"10.1109/ICSPCS.2018.8631720","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631720","url":null,"abstract":"In this paper, we analyze the performance of a non-orthogonal multiple access (NOMA) energy harvesting (EH) relaying system with the residual transmit RF impairments (RTRI) over a Rayleigh fading channel. Users in our proposed system are allocated with different power levels. The source node communicates with the near user using the direct link and communicates with the far user via an amplify-and-forward (AF) relay which uses the time-switching (TS) protocol to harvest energy from the source's signal. The near user also receives the signal broadcasted by the relay and uses this signal to improve its performance. To evaluate the performance of system, the expressions for outage probability (OP) and throughput are derived, and these analyses are verified by a Monte Carlo simulation. Moreover, the effects of various parameters, such as power allocation levels, target data rate, EH efficiency and transmit hardware impairment levels on the OP and throughput of proposed system are investigated.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124433672","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631712
Vidhi Jindal, Ayushi Jha, K. Goel, Vivekanand Jha
This paper addresses two major problems in the field of wireless sensor networks - coverage hole problem and energy hole problem. Coverage holes are created due to the inability of deployed sensor nodes to cover the entire network field. Energy hole problem arises when some sensor nodes are overwhelmed due to their location to the sinks, leading to faster energy depletion and shorter network lifetimes. We propose a node deployment strategy and mobile sink trajectory to address these issues. Data dissemination in the network follows our proposed multi-hop routing scheme based on the proximity of sensor nodes to the mobile sink's location and their remaining energy levels. Finally, to increase the network lifetime and prevent fast depletion of sensor node energies we implement sleep scheduling for a subset of nodes based on the current position of the mobile sink.
{"title":"Improving Network Lifetime and Area Coverage with Optimal Sink Mobility Pattern and Node Deployment Strategy in WSN","authors":"Vidhi Jindal, Ayushi Jha, K. Goel, Vivekanand Jha","doi":"10.1109/ICSPCS.2018.8631712","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631712","url":null,"abstract":"This paper addresses two major problems in the field of wireless sensor networks - coverage hole problem and energy hole problem. Coverage holes are created due to the inability of deployed sensor nodes to cover the entire network field. Energy hole problem arises when some sensor nodes are overwhelmed due to their location to the sinks, leading to faster energy depletion and shorter network lifetimes. We propose a node deployment strategy and mobile sink trajectory to address these issues. Data dissemination in the network follows our proposed multi-hop routing scheme based on the proximity of sensor nodes to the mobile sink's location and their remaining energy levels. Finally, to increase the network lifetime and prevent fast depletion of sensor node energies we implement sleep scheduling for a subset of nodes based on the current position of the mobile sink.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128136512","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 : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631772
K. Shahzad
In this work, a covert communication scheme under block-fading channels is proposed where the relay, apart from forwarding source's information to the destination, also acts as a cooperative jammer. Stating precisely, the relay amplifies source's signal when required to relay the signal to the destination, otherwise it transmits artificial noise with random power, causing errors in the received signal statistics of the adversary, Willie, who employs a radiometer for detection of covert transmissions. Stating the condition under which Willie makes detection errors, we first find the optimal detection threshold of Willie's detector and his minimum detection error probability and then derive the expected value of this error probability, establishing Willies detection performance from the perspective of the covert communication pair. Furthermore, for a given maximum transmit power at the relay, we derive a closed-form expression for the optimal transmit power of covert communication. Our numerical results illustrate the advantage cooperative jamming offers for achieving covertness, and demonstrate how the choice of transmit power used for covert transmissions is affected by Willie's error performance and required level of covertness.
{"title":"Relaying via Cooperative Jamming in Covert Wireless Communications","authors":"K. Shahzad","doi":"10.1109/ICSPCS.2018.8631772","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631772","url":null,"abstract":"In this work, a covert communication scheme under block-fading channels is proposed where the relay, apart from forwarding source's information to the destination, also acts as a cooperative jammer. Stating precisely, the relay amplifies source's signal when required to relay the signal to the destination, otherwise it transmits artificial noise with random power, causing errors in the received signal statistics of the adversary, Willie, who employs a radiometer for detection of covert transmissions. Stating the condition under which Willie makes detection errors, we first find the optimal detection threshold of Willie's detector and his minimum detection error probability and then derive the expected value of this error probability, establishing Willies detection performance from the perspective of the covert communication pair. Furthermore, for a given maximum transmit power at the relay, we derive a closed-form expression for the optimal transmit power of covert communication. Our numerical results illustrate the advantage cooperative jamming offers for achieving covertness, and demonstrate how the choice of transmit power used for covert transmissions is affected by Willie's error performance and required level of covertness.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128622074","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
扫码关注我们
求助内容：
应助结果提醒方式：