Pub Date : 2015-08-20DOI: 10.1109/IC3.2015.7346718
Anuradha Pughat, Vidushi Sharma
Energy constraint wireless sensor networks area is the most promising research domain today. A dynamic power management technique at operational level can effectively oversee the power consumption and prolong the lifespan of a sensor node. Several stochastic models have been introduced and presented to analyze the system. To improve upon the given models, a semi Markov model with analyser has been proposed. Further, this paper gives the detailed stochastic modelling and analysis of lifetime improvement and power consumption of analyser based sensor node. To observe the effect of analyser on overall power consumption of sensor node, the power consumption of analyser block is also analyzed.
{"title":"Stochastic model for lifetime improvement of wireless sensor node","authors":"Anuradha Pughat, Vidushi Sharma","doi":"10.1109/IC3.2015.7346718","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346718","url":null,"abstract":"Energy constraint wireless sensor networks area is the most promising research domain today. A dynamic power management technique at operational level can effectively oversee the power consumption and prolong the lifespan of a sensor node. Several stochastic models have been introduced and presented to analyze the system. To improve upon the given models, a semi Markov model with analyser has been proposed. Further, this paper gives the detailed stochastic modelling and analysis of lifetime improvement and power consumption of analyser based sensor node. To observe the effect of analyser on overall power consumption of sensor node, the power consumption of analyser block is also analyzed.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123719213","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346731
A. Nath, R. Niyogi
Although there has been a lot of work in multi-agent planning, very few state-of-the-art multi-agent planners exist; a notable exception being FMAP. In multi agent planning joint actions frequently arise. Although FMAP is quite powerful, it cannot handle a type of joint actions. In this paper, we show how FMAP can be tuned to handle such joint actions. The proposed system has been validated with a benchmark domain.
{"title":"An extension of FMAP for joint actions","authors":"A. Nath, R. Niyogi","doi":"10.1109/IC3.2015.7346731","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346731","url":null,"abstract":"Although there has been a lot of work in multi-agent planning, very few state-of-the-art multi-agent planners exist; a notable exception being FMAP. In multi agent planning joint actions frequently arise. Although FMAP is quite powerful, it cannot handle a type of joint actions. In this paper, we show how FMAP can be tuned to handle such joint actions. The proposed system has been validated with a benchmark domain.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128932032","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346717
Vaibhav Rastogi, Ankit Agrawal
The websites of the modern Web integrate content from multiple parties to provide an enriched user experience. The so-called single sign-on forms part of this integration whereby a relying website enables a user to use her credentials on a third-party provider (such as Google or Facebook) to authenticate with itself and, if desired, authorize itself to use her resources on the provider. The user benefits by not remembering credentials for different websites separately and by allowing controlled use of her resources with a provider by other website. However, we observe that the current protocols for single sign-on do not have any provision of what we call single sign-off: once the user logs out of a relying website, the user still remains signed into the provider website. This can leave the user vulnerable if she forgets to sign out of the provider website after signing out of the relying website on a shared computer. We manually analyze the top twenty websites using Facebook or Google providers and conclude that the above problem is widespread. All but one website do not even warn the user with regard to this problem.
{"title":"All your Google and Facebook logins are belong to us: A case for single sign-off","authors":"Vaibhav Rastogi, Ankit Agrawal","doi":"10.1109/IC3.2015.7346717","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346717","url":null,"abstract":"The websites of the modern Web integrate content from multiple parties to provide an enriched user experience. The so-called single sign-on forms part of this integration whereby a relying website enables a user to use her credentials on a third-party provider (such as Google or Facebook) to authenticate with itself and, if desired, authorize itself to use her resources on the provider. The user benefits by not remembering credentials for different websites separately and by allowing controlled use of her resources with a provider by other website. However, we observe that the current protocols for single sign-on do not have any provision of what we call single sign-off: once the user logs out of a relying website, the user still remains signed into the provider website. This can leave the user vulnerable if she forgets to sign out of the provider website after signing out of the relying website on a shared computer. We manually analyze the top twenty websites using Facebook or Google providers and conclude that the above problem is widespread. All but one website do not even warn the user with regard to this problem.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"78 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361570","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346659
Abhishek Jatram, Bhaskar Biswas
FANNY is a fuzzy or soft clustering algorithm, where each node in the graph is associated with a membership coefficient, indicating degree of belongingness of each node to different clusters. In this paper, we proposed a method for multiple dimension reduction of feature space of graphs or networks by using Spectral methods for FANNY clustering algorithm. Simulations of our method on two real networks show that, the proposed algorithm produced better result than traditional FANNY in-terms of runtime as well as modularity.
{"title":"Dimension reduction using spectral methods in FANNY for fuzzy clustering of graphs","authors":"Abhishek Jatram, Bhaskar Biswas","doi":"10.1109/IC3.2015.7346659","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346659","url":null,"abstract":"FANNY is a fuzzy or soft clustering algorithm, where each node in the graph is associated with a membership coefficient, indicating degree of belongingness of each node to different clusters. In this paper, we proposed a method for multiple dimension reduction of feature space of graphs or networks by using Spectral methods for FANNY clustering algorithm. Simulations of our method on two real networks show that, the proposed algorithm produced better result than traditional FANNY in-terms of runtime as well as modularity.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122050950","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346673
S. Panda, R. Das
In this work, various geometrical configurations of a conductive, convective and radiative cylindrical porous fin are estimated by using inverse heat transfer analysis. The temperature distribution, which is used in the inverse analysis, has been calculated by using the finite difference method in conjunction with the genetic algorithm. The study discloses that many feasible combinations of the fin dimensions are possible to acquire a given temperature. This provides the flexibility in selecting a cylindrical porous fin to achieve a given heat transfer duty.
{"title":"Inverse analysis of a radial porous fin using genetic algorithm","authors":"S. Panda, R. Das","doi":"10.1109/IC3.2015.7346673","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346673","url":null,"abstract":"In this work, various geometrical configurations of a conductive, convective and radiative cylindrical porous fin are estimated by using inverse heat transfer analysis. The temperature distribution, which is used in the inverse analysis, has been calculated by using the finite difference method in conjunction with the genetic algorithm. The study discloses that many feasible combinations of the fin dimensions are possible to acquire a given temperature. This provides the flexibility in selecting a cylindrical porous fin to achieve a given heat transfer duty.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126612870","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346678
Avinash Kumar Singh, Neha Baranwal, G. Nandi
In India like many other countries, the crimes especially against women are rising. One of the many reasons perhaps is the low conviction rate. The initial stage of criminal investigation starts with the exploration of evidences and eyewitnesses. An eyewitness can act as a guide to trace out the suspect. Her/his perception about the suspect can be useful to identify the criminal. Based on the descriptions of the eyewitnesses normally a manual sketch is prepared and released in the Newspapers which most of the times is vague and ambiguous and hence ineffective. Therefore, a robotic framework has been proposed in this paper to help Police to identify criminals using the imprecise knowledge about the subject. The designed robotic system interacts with the eyewitness by asking several questions about the suspect such as age, height, her/his facial shape and size etc., and then making a guess about her/his face. A human face can be considered as the combination of various macro facial features such as eye. Eyebrows, face shape, lip shape, nose type etc. Although these features vary from person to person but their combination makes a human face unique. An experimental study on 113 Indian Bollywood celebrities, 37 Indian cricketers and 40 persons from Robotics and Artificial Intelligence Laboratory of Indian Institute of Technology Allahabad, India has been performed. The system is able to identify the criminal (here pseudo criminals) if it exists in the database. This system can be useful at the initial stage of investigation where we don't have any knowledge about the criminal.
{"title":"Human perception based criminal identification through human robot interaction","authors":"Avinash Kumar Singh, Neha Baranwal, G. Nandi","doi":"10.1109/IC3.2015.7346678","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346678","url":null,"abstract":"In India like many other countries, the crimes especially against women are rising. One of the many reasons perhaps is the low conviction rate. The initial stage of criminal investigation starts with the exploration of evidences and eyewitnesses. An eyewitness can act as a guide to trace out the suspect. Her/his perception about the suspect can be useful to identify the criminal. Based on the descriptions of the eyewitnesses normally a manual sketch is prepared and released in the Newspapers which most of the times is vague and ambiguous and hence ineffective. Therefore, a robotic framework has been proposed in this paper to help Police to identify criminals using the imprecise knowledge about the subject. The designed robotic system interacts with the eyewitness by asking several questions about the suspect such as age, height, her/his facial shape and size etc., and then making a guess about her/his face. A human face can be considered as the combination of various macro facial features such as eye. Eyebrows, face shape, lip shape, nose type etc. Although these features vary from person to person but their combination makes a human face unique. An experimental study on 113 Indian Bollywood celebrities, 37 Indian cricketers and 40 persons from Robotics and Artificial Intelligence Laboratory of Indian Institute of Technology Allahabad, India has been performed. The system is able to identify the criminal (here pseudo criminals) if it exists in the database. This system can be useful at the initial stage of investigation where we don't have any knowledge about the criminal.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985827","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346668
Siddharth Gulati, Abhinav Rastogi, M. Thakur
Augmented Reality (AR) helps create information-enriched, real-time environments that are close to the real world. This paper discusses a unique defense planning tool that has been developed as a technology demonstrator with systems and applications in AR. This tool has a direct link to the planning aspect of strategy development. It is expected that this will serve as a very useful tool for testing the concepts of defense strategic planning. It has features that can simulate an actual war-zone situation, which can help to test the strengths and weaknesses of the proposed defense strategies in real-time. Post simulation analysis of these strategies can help to modify the defense strategy (if needed) and strengthen the on-ground capacities and capabilities of the defense forces for mitigating the perceived threats from the enemy. It is a versatile tool, which can be further adapted to develop strategies that will help in minimizing the impact of natural calamities in zones which are prone to recurrent floods and seismic disturbances, thus contributing to improved disaster preparedness and management.
{"title":"Dynamic simulator and planning tool for studying the defense and attack strategies in a war-zone","authors":"Siddharth Gulati, Abhinav Rastogi, M. Thakur","doi":"10.1109/IC3.2015.7346668","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346668","url":null,"abstract":"Augmented Reality (AR) helps create information-enriched, real-time environments that are close to the real world. This paper discusses a unique defense planning tool that has been developed as a technology demonstrator with systems and applications in AR. This tool has a direct link to the planning aspect of strategy development. It is expected that this will serve as a very useful tool for testing the concepts of defense strategic planning. It has features that can simulate an actual war-zone situation, which can help to test the strengths and weaknesses of the proposed defense strategies in real-time. Post simulation analysis of these strategies can help to modify the defense strategy (if needed) and strengthen the on-ground capacities and capabilities of the defense forces for mitigating the perceived threats from the enemy. It is a versatile tool, which can be further adapted to develop strategies that will help in minimizing the impact of natural calamities in zones which are prone to recurrent floods and seismic disturbances, thus contributing to improved disaster preparedness and management.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127273360","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346739
M. Shirole, Rajeev Kumar
Parallel systems have potentially exponential number of execution interleaving sequences. Each execution interleaving sequence can be used as a test scenario to evaluate the correctness of the system. Both the exponential interleaving space and non-deterministic execution make testing concurrent systems a challenging task. Concurrency errors are classified as synchronization, data-race, data inconsistency, starvation, and deadlock. A good test suite must have test scenarios that uncover above all classes of errors. Selecting test scenarios to uncover above errors needs a systematic analysis of test scenarios to classify them into one of concurrency behaviors. In this paper, we propose an approach to analyze test scenarios from UML models using a state-based classifier. First, we present an extension to UML models to represent data access-tags, which help generating data-access traces. Then, we generate test scenarios from extended UML models using existing test scenario generation techniques. After that, we analyze test scenarios using enhanced state machine diagram (ESMD) classifier for concurrency behaviors, like sequentilization, synchronization, blocking, and non-blocking scenarios. Experimental results show ESMD classifier classifies test scenario accurately thereby helping to design test suite for concurrency testing. Selected test scenarios achieve better concurrency behavior coverage and avoid false test scenarios.
{"title":"Test scenario selection for concurrency testing from UML models","authors":"M. Shirole, Rajeev Kumar","doi":"10.1109/IC3.2015.7346739","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346739","url":null,"abstract":"Parallel systems have potentially exponential number of execution interleaving sequences. Each execution interleaving sequence can be used as a test scenario to evaluate the correctness of the system. Both the exponential interleaving space and non-deterministic execution make testing concurrent systems a challenging task. Concurrency errors are classified as synchronization, data-race, data inconsistency, starvation, and deadlock. A good test suite must have test scenarios that uncover above all classes of errors. Selecting test scenarios to uncover above errors needs a systematic analysis of test scenarios to classify them into one of concurrency behaviors. In this paper, we propose an approach to analyze test scenarios from UML models using a state-based classifier. First, we present an extension to UML models to represent data access-tags, which help generating data-access traces. Then, we generate test scenarios from extended UML models using existing test scenario generation techniques. After that, we analyze test scenarios using enhanced state machine diagram (ESMD) classifier for concurrency behaviors, like sequentilization, synchronization, blocking, and non-blocking scenarios. Experimental results show ESMD classifier classifies test scenario accurately thereby helping to design test suite for concurrency testing. Selected test scenarios achieve better concurrency behavior coverage and avoid false test scenarios.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132651430","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346667
P. B. Ramteke, S. Koolagudi, Arun Prabhakar
Mispronunciation is commonly observed in children from age 2 to 8 years. Some of the common mispronunciations are stopping, fronting, backing and affrication. These processes are known as phonological processes. Identification of these processes is crucial in studying the vocal tract development pattern and treating the phonological disorders in children. The features that clearly discriminate correctly pronounced phoneme from corresponding mispronounced phoneme have to be compared to identify the phonological processes. This paper focuses on the analysis of mispronounced alveolar approximant (/r/) substituted with voiced fricative consonant (/∂/). In this work, spectral and pitch related features are considered for the analysis using scatter plots and histograms. From the analysis, it is observed that the energy feature against 2nd and 4th cepstral coefficients achieves 75% and 65% discrimination respectively.
{"title":"Feature analysis for mispronounced phonemes in the case of alvoelar approximant (/r/) substituted with voiced dental consonant (/∂/)","authors":"P. B. Ramteke, S. Koolagudi, Arun Prabhakar","doi":"10.1109/IC3.2015.7346667","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346667","url":null,"abstract":"Mispronunciation is commonly observed in children from age 2 to 8 years. Some of the common mispronunciations are stopping, fronting, backing and affrication. These processes are known as phonological processes. Identification of these processes is crucial in studying the vocal tract development pattern and treating the phonological disorders in children. The features that clearly discriminate correctly pronounced phoneme from corresponding mispronounced phoneme have to be compared to identify the phonological processes. This paper focuses on the analysis of mispronounced alveolar approximant (/r/) substituted with voiced fricative consonant (/∂/). In this work, spectral and pitch related features are considered for the analysis using scatter plots and histograms. From the analysis, it is observed that the energy feature against 2nd and 4th cepstral coefficients achieves 75% and 65% discrimination respectively.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"34 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123342634","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 : 2015-08-20DOI: 10.1109/IC3.2015.7346743
Bhuvan Mehan, Sanjay Batish, R. Bhatia, A. Dhiman
Border Node preferred Social Ranking based Routing Protocol (BNSR) is present in this paper which is the expansion of the BMFR routing protocol. Routing strategy of BNSR follows the position based routing by using any location services such as GPS system and forwarding strategy follows the prominence of border node based forwarding to shrivel the delay and optimize the path length. BNSR considers the concept of social ranking which is a parameter of CODO (continuous opinion dynamic optimization) technique on which basis the next hop border node is selected. The protocol is simulated with NS2 simulator and results shows the algorithm works well and produces better packet delivery ratio (PDR) and minimum end-to-end delay. When compared with BMFR protocol the consequence of purposed protocol is much better and much efficient in VANETs. We are the first to acquaint the concept of social ranking in selecting the next hop border nodes in the best of our knowledge.
{"title":"BNSR: Border Node preferred Social Ranking based Routing Protocol for VANETs","authors":"Bhuvan Mehan, Sanjay Batish, R. Bhatia, A. Dhiman","doi":"10.1109/IC3.2015.7346743","DOIUrl":"https://doi.org/10.1109/IC3.2015.7346743","url":null,"abstract":"Border Node preferred Social Ranking based Routing Protocol (BNSR) is present in this paper which is the expansion of the BMFR routing protocol. Routing strategy of BNSR follows the position based routing by using any location services such as GPS system and forwarding strategy follows the prominence of border node based forwarding to shrivel the delay and optimize the path length. BNSR considers the concept of social ranking which is a parameter of CODO (continuous opinion dynamic optimization) technique on which basis the next hop border node is selected. The protocol is simulated with NS2 simulator and results shows the algorithm works well and produces better packet delivery ratio (PDR) and minimum end-to-end delay. When compared with BMFR protocol the consequence of purposed protocol is much better and much efficient in VANETs. We are the first to acquaint the concept of social ranking in selecting the next hop border nodes in the best of our knowledge.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122413735","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
扫码关注我们
求助内容：
应助结果提醒方式：