Pub Date : 2012-10-01DOI: 10.1109/WICT.2012.6409193
R. Mishra, M. Zeeshaan, S. Singh
Two way buffer system is a system that exhibits transfer of data using two buffers concurrently. It includes processes that synchronize to exchange data with each other along with executing certain delays between these synchronizations. In existing Tiny two way buffer system, both generators produce packets in half duplex manner after a delay of 10 seconds. However, generator one has an initial shift of 5 seconds after which it begins sending a packet every 10 seconds. Hence, initial delay for generator one is 15 seconds and for generator two it is 10 seconds. Due to this initial shift, both generators produce packets alternatively and is deadlock free as the packets do not meet at the same time instant. Moreover, the existing system model is not concurrent and hence takes more time for packet transfer in every iteration. In this paper we have proposed a model of buffer system using an additional dummy buffer for transfer of data packets, by introducing delay in various buffers of the proposed system that speeds up the transfer of packets. As a result the transfer of data becomes concurrent, deadlock free and hence the model proposed is time efficient. To model and simulate the proposed system we have used UPPAAL as a model checking tool environment for modeling, validation and verification of real-time systems modeled as networks of timed automata. Simulation results shows that the proposed two way buffer system is fully concurrent and time efficient as compared to the existing buffer system.
{"title":"Modeling two way concurrent buffer system using timed automata in UPPAAL","authors":"R. Mishra, M. Zeeshaan, S. Singh","doi":"10.1109/WICT.2012.6409193","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409193","url":null,"abstract":"Two way buffer system is a system that exhibits transfer of data using two buffers concurrently. It includes processes that synchronize to exchange data with each other along with executing certain delays between these synchronizations. In existing Tiny two way buffer system, both generators produce packets in half duplex manner after a delay of 10 seconds. However, generator one has an initial shift of 5 seconds after which it begins sending a packet every 10 seconds. Hence, initial delay for generator one is 15 seconds and for generator two it is 10 seconds. Due to this initial shift, both generators produce packets alternatively and is deadlock free as the packets do not meet at the same time instant. Moreover, the existing system model is not concurrent and hence takes more time for packet transfer in every iteration. In this paper we have proposed a model of buffer system using an additional dummy buffer for transfer of data packets, by introducing delay in various buffers of the proposed system that speeds up the transfer of packets. As a result the transfer of data becomes concurrent, deadlock free and hence the model proposed is time efficient. To model and simulate the proposed system we have used UPPAAL as a model checking tool environment for modeling, validation and verification of real-time systems modeled as networks of timed automata. Simulation results shows that the proposed two way buffer system is fully concurrent and time efficient as compared to the existing buffer system.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114660579","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409120
D. C. Gavankar, M. Chatterjee, S. J. Lawand
Advances in video technology and computing gave a way to the growth for applications and devices in real time video monitoring. Video data containing real and accurate information is being used greatly by monitoring system. Monitoring systems are widely used at public institutions, banks, corporate and laboratories where security is very an important aspect. There is a growing need to visually monitor an area from a remote location using a video camera or web cam. The proliferation of web cams and the increasing use of streaming media have improved the ability of users to communicate with each other, to be entertained and to monitor or perform surveillance. Along with this the security of data travelling over network becomes essential. In this paper we propose a selective encryption based video monitoring system (SEVMS), which securely transfer data over untrusted nefwork. The live video data transferred over network is compressed and then selectively encrypted. Since the live video is selectively encrypted any unauthenticated person will not be able to view it. The system also provides facility of video on demand (VOD).
{"title":"Secure real time remote video monitoring using selective encryption","authors":"D. C. Gavankar, M. Chatterjee, S. J. Lawand","doi":"10.1109/WICT.2012.6409120","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409120","url":null,"abstract":"Advances in video technology and computing gave a way to the growth for applications and devices in real time video monitoring. Video data containing real and accurate information is being used greatly by monitoring system. Monitoring systems are widely used at public institutions, banks, corporate and laboratories where security is very an important aspect. There is a growing need to visually monitor an area from a remote location using a video camera or web cam. The proliferation of web cams and the increasing use of streaming media have improved the ability of users to communicate with each other, to be entertained and to monitor or perform surveillance. Along with this the security of data travelling over network becomes essential. In this paper we propose a selective encryption based video monitoring system (SEVMS), which securely transfer data over untrusted nefwork. The live video data transferred over network is compressed and then selectively encrypted. Since the live video is selectively encrypted any unauthenticated person will not be able to view it. The system also provides facility of video on demand (VOD).","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117202123","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409148
Tribhuvanesh Orekondy, S. Gosukonda, K. Srinivasa
Static Authentication provides a secure framework for a one-time authentication session, but fails to authenticate the user throughout the session. This presents the possibility of an imposter gaining access when a user session is active and the user moves away from the system. Continuous Authentication on the other hand, aims to authenticate the user right from the initial stages of log-in till logout. The proposed framework provides unobtrusive Continuous Authentication, by alternating between two modes which utilize hard and soft biometrics respectively, depending on certain confidence parameters. We use facial features as the hard biometric trait for recognizing the user. Employing face recognition for extended periods of time produces noise, which is dampened by using a supervised machine learning algorithm. The color of user's clothing as the soft biometric trait relieves the CPU of comparatively high computation and relaxes constraints on the user's upper body movement.
{"title":"Application of support vector machine in Continuous Authentication","authors":"Tribhuvanesh Orekondy, S. Gosukonda, K. Srinivasa","doi":"10.1109/WICT.2012.6409148","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409148","url":null,"abstract":"Static Authentication provides a secure framework for a one-time authentication session, but fails to authenticate the user throughout the session. This presents the possibility of an imposter gaining access when a user session is active and the user moves away from the system. Continuous Authentication on the other hand, aims to authenticate the user right from the initial stages of log-in till logout. The proposed framework provides unobtrusive Continuous Authentication, by alternating between two modes which utilize hard and soft biometrics respectively, depending on certain confidence parameters. We use facial features as the hard biometric trait for recognizing the user. Employing face recognition for extended periods of time produces noise, which is dampened by using a supervised machine learning algorithm. The color of user's clothing as the soft biometric trait relieves the CPU of comparatively high computation and relaxes constraints on the user's upper body movement.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121078118","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409138
V. Mohite, L. Ragha
A mobile ad hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi-hop radio network and maintaining connections in a decentralized manner. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of clear lines of defence. Ad hoc on-demand distance vector routing (AODV) is a very popular routing algorithm, they enables dynamic, self-starting, multi hop routing between participating mobile nodes wishing to establish and maintain an Ad Hoc network. An intermediate node, which takes part in packets forwarding, may behave maliciously and drop packets which goes through it, instead of forwarding them to the following node, where a malicious node falsely advertises good paths to a destination node during the route discovery process, such behavior is called blackhole attack. This attack becomes more sever when a group of malicious nodes cooperate to each other. However, it is vulnerable to the well-known cooperative blackhole attack. In this paper, a Detecting mechanism is presented against a coordinated attack by cooperative blackhole nodes in a MANET plus a method to secure the history records of packet delivery information at each contact so that other nodes can detect insider attacks (grayhole attack) by analyzing these packet delivery records and avoid the blackhole and the cooperative blackhole attacks by using Cooperative Security Agents.
{"title":"Cooperative Security Agents for MANET","authors":"V. Mohite, L. Ragha","doi":"10.1109/WICT.2012.6409138","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409138","url":null,"abstract":"A mobile ad hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi-hop radio network and maintaining connections in a decentralized manner. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of clear lines of defence. Ad hoc on-demand distance vector routing (AODV) is a very popular routing algorithm, they enables dynamic, self-starting, multi hop routing between participating mobile nodes wishing to establish and maintain an Ad Hoc network. An intermediate node, which takes part in packets forwarding, may behave maliciously and drop packets which goes through it, instead of forwarding them to the following node, where a malicious node falsely advertises good paths to a destination node during the route discovery process, such behavior is called blackhole attack. This attack becomes more sever when a group of malicious nodes cooperate to each other. However, it is vulnerable to the well-known cooperative blackhole attack. In this paper, a Detecting mechanism is presented against a coordinated attack by cooperative blackhole nodes in a MANET plus a method to secure the history records of packet delivery information at each contact so that other nodes can detect insider attacks (grayhole attack) by analyzing these packet delivery records and avoid the blackhole and the cooperative blackhole attacks by using Cooperative Security Agents.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121221320","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409176
S. Vigneshwari, M. Aramudhan
In the modernized computer era, everything is needed to be personalized for ease of access. XML plays an important role in information retrieval systems. Since XML is a common format, it is easy to understand as well as easy to construct. In this paper, a novel model is proposed for personalizing the web using XML based ontologies.
{"title":"An approach to personalize the web using XML based ontologies","authors":"S. Vigneshwari, M. Aramudhan","doi":"10.1109/WICT.2012.6409176","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409176","url":null,"abstract":"In the modernized computer era, everything is needed to be personalized for ease of access. XML plays an important role in information retrieval systems. Since XML is a common format, it is easy to understand as well as easy to construct. In this paper, a novel model is proposed for personalizing the web using XML based ontologies.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116001380","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409238
Liu Zhirun, Li Guangyu
There are three problems at present that SAIDA and eSAIDA can resist packet-loss but cannot resist packet-injection, and PRABS can resist packet-injection but the communication cost is too large. We propose a new real-time packet-injection-loss resistant data source authentication protocol (RPILRSA) in this paper. Using merkle hash tree, RPILRSA can discover the packets which are injected by the attacker before verifying the signature. Using erasure codes, this protocol can resist packet-loss in a certain extent, and realize real-time authentication by dividing data into blocks. Analysis shows that RPILRSA's communication cost is about 7%~9% of PRABS, and the cost of computing and verifying authentication information in RPILRSA is also less than in PRABS.
{"title":"Real time packet-injection-loss resistant data source authentication protocol for group communication","authors":"Liu Zhirun, Li Guangyu","doi":"10.1109/WICT.2012.6409238","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409238","url":null,"abstract":"There are three problems at present that SAIDA and eSAIDA can resist packet-loss but cannot resist packet-injection, and PRABS can resist packet-injection but the communication cost is too large. We propose a new real-time packet-injection-loss resistant data source authentication protocol (RPILRSA) in this paper. Using merkle hash tree, RPILRSA can discover the packets which are injected by the attacker before verifying the signature. Using erasure codes, this protocol can resist packet-loss in a certain extent, and realize real-time authentication by dividing data into blocks. Analysis shows that RPILRSA's communication cost is about 7%~9% of PRABS, and the cost of computing and verifying authentication information in RPILRSA is also less than in PRABS.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122638839","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409232
Leida Li, Shushang Li, Jun Wang
Copy-move is one of the most common method for image tampering. Many methods have been proposed to detect the tampered regions. However, it is hard to detect the tampered regions when they are rotated before being pasted. To solve the problem, this paper presents a novel approach for detecting region-duplication forgery with rotation. Polar Harmonic Transform (PHT) is employed to extract the features of the circular blocks, which are then used to perform block matching. Experimental results show that the proposed method is not only robust to added noise and JPEG compression, but also robust to object rotation. Simulation results demonstrate the performances of the proposed scheme.
{"title":"Copy-move forgery detection based on PHT","authors":"Leida Li, Shushang Li, Jun Wang","doi":"10.1109/WICT.2012.6409232","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409232","url":null,"abstract":"Copy-move is one of the most common method for image tampering. Many methods have been proposed to detect the tampered regions. However, it is hard to detect the tampered regions when they are rotated before being pasted. To solve the problem, this paper presents a novel approach for detecting region-duplication forgery with rotation. Polar Harmonic Transform (PHT) is employed to extract the features of the circular blocks, which are then used to perform block matching. Experimental results show that the proposed method is not only robust to added noise and JPEG compression, but also robust to object rotation. Simulation results demonstrate the performances of the proposed scheme.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114144322","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409100
R. K. James, K. Jacob, S. Sasi
This paper presents two universal 4×4 `reversible RPS gates' that can function as a reversible 4-bit Binary to BCD converter with a garbage count of zero. The new `fully or partially reversible RPS gate' gives an optimized design of the offset correction circuit of a reversible Binary Coded Decimal (BCD) adder. The paper proposes reversible implementations of BCD adder using fully reversible RPS gates and using combination of HNC-RPS (fully and partially) gates; and the comparisons are tabulated. The HNG-RPS designs achieve a reduction in garbage outputs and logical complexity compared to the existing reversible BCD adder designs. This can form the basic building block of a high speed decimal `Arithmetic and Logic Unit (ALU)' for a low power reversible `Central Processing Unit (CPU)'.
{"title":"Design of compact reversible decimal adder using RPS gates","authors":"R. K. James, K. Jacob, S. Sasi","doi":"10.1109/WICT.2012.6409100","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409100","url":null,"abstract":"This paper presents two universal 4×4 `reversible RPS gates' that can function as a reversible 4-bit Binary to BCD converter with a garbage count of zero. The new `fully or partially reversible RPS gate' gives an optimized design of the offset correction circuit of a reversible Binary Coded Decimal (BCD) adder. The paper proposes reversible implementations of BCD adder using fully reversible RPS gates and using combination of HNC-RPS (fully and partially) gates; and the comparisons are tabulated. The HNG-RPS designs achieve a reduction in garbage outputs and logical complexity compared to the existing reversible BCD adder designs. This can form the basic building block of a high speed decimal `Arithmetic and Logic Unit (ALU)' for a low power reversible `Central Processing Unit (CPU)'.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457353","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409260
F. Zheng, Shufen Liu
Considering data storage characteristics of noncable seismograph, accommodating to the requirement of further processing, a new parallel seismic data compression algorithm is developed based on the integer wavelet transform. First, separate the valid file header and extract the valid data to 4 one-dimensional matrixes. Then compress the four matrixes in parallel: the time signals are converted into transform domain by using the integer wavelet transform, where low frequency wavelet coefficients are retained and high frequency ones are scalar quantized. Lossless encoding is then conducted to deliver compression output. Experiments have shown that, at the same compression ratio, the proposed algorithm compresses 30% faster than traditional approach which directly uses two-dimensional wavelet transform to process two-dimensional matrixes, and yields good compression results.
{"title":"A fast compression algorithm for seismic data from non-cable seismographs","authors":"F. Zheng, Shufen Liu","doi":"10.1109/WICT.2012.6409260","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409260","url":null,"abstract":"Considering data storage characteristics of noncable seismograph, accommodating to the requirement of further processing, a new parallel seismic data compression algorithm is developed based on the integer wavelet transform. First, separate the valid file header and extract the valid data to 4 one-dimensional matrixes. Then compress the four matrixes in parallel: the time signals are converted into transform domain by using the integer wavelet transform, where low frequency wavelet coefficients are retained and high frequency ones are scalar quantized. Lossless encoding is then conducted to deliver compression output. Experiments have shown that, at the same compression ratio, the proposed algorithm compresses 30% faster than traditional approach which directly uses two-dimensional wavelet transform to process two-dimensional matrixes, and yields good compression results.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121704309","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409237
Rui Liu, Jianjun Hao, Yijun Guo
Network coding has contributed a lot for improving the throughput of network. In scenarios with packet losses, insufficient reception of encoded packets causes NC losses which are expensive. Multi-Generation Mixing Network Coding (MGM-NC) increases the successful decoding probability through grouping different generations into a mixing-generation. However, the cost is high calculation complexity and large decoding time delay. In this paper, an improved method of MGM-NC is proposed, which achieves extremely low consumption, while maintaining its excellent performance resisting to NC losses. System performance is improved in three respects compared with MGM-NC, including decoding time delay, calculation complexity and transport overhead. Both theoretical and simulations are presented to demonstrate the improved method has a better performance than both traditional network coding and MGM-NC.
{"title":"An improved method of Muti-Generation Mixing Network Coding","authors":"Rui Liu, Jianjun Hao, Yijun Guo","doi":"10.1109/WICT.2012.6409237","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409237","url":null,"abstract":"Network coding has contributed a lot for improving the throughput of network. In scenarios with packet losses, insufficient reception of encoded packets causes NC losses which are expensive. Multi-Generation Mixing Network Coding (MGM-NC) increases the successful decoding probability through grouping different generations into a mixing-generation. However, the cost is high calculation complexity and large decoding time delay. In this paper, an improved method of MGM-NC is proposed, which achieves extremely low consumption, while maintaining its excellent performance resisting to NC losses. System performance is improved in three respects compared with MGM-NC, including decoding time delay, calculation complexity and transport overhead. Both theoretical and simulations are presented to demonstrate the improved method has a better performance than both traditional network coding and MGM-NC.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115891194","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
扫码关注我们
求助内容：
应助结果提醒方式：