W. Kong, N. Katahira, Wanpeng Qian, Masahiko Watanabe, T. Katayama, Akira Fukuda
State Transition Matrix (STM) is a table-based modeling language for developing designs of software systems. Although widely accepted and used in software industry, there is lack of formal verification supports for conducting rigorous analysis to improve reliability of STM designs. In this paper, we present a symbolic encoding approach for STM designs that employ message passing as the means of communication, through which correctness of a STM design with respect to invariant properties could be Bounded Model Checked (BMC) by using Satisfiability Modulo Theories (SMT) solving techniques. We have built a prototype implementation of the proposed encoding and the state-of-the-art SMT solver -- Yices, is used in our experiments as a back-end tool to evaluate the effectiveness of our approach. In addition, two approaches for accelerating SMT solving by introducing additional knowledge are proposed and their effectiveness is shown by our preliminary experimental results.
{"title":"An SMT-Based Approach to Bounded Model Checking of Designs in Communicating State Transition Matrix","authors":"W. Kong, N. Katahira, Wanpeng Qian, Masahiko Watanabe, T. Katayama, Akira Fukuda","doi":"10.1109/ICCSA.2011.30","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.30","url":null,"abstract":"State Transition Matrix (STM) is a table-based modeling language for developing designs of software systems. Although widely accepted and used in software industry, there is lack of formal verification supports for conducting rigorous analysis to improve reliability of STM designs. In this paper, we present a symbolic encoding approach for STM designs that employ message passing as the means of communication, through which correctness of a STM design with respect to invariant properties could be Bounded Model Checked (BMC) by using Satisfiability Modulo Theories (SMT) solving techniques. We have built a prototype implementation of the proposed encoding and the state-of-the-art SMT solver -- Yices, is used in our experiments as a back-end tool to evaluate the effectiveness of our approach. In addition, two approaches for accelerating SMT solving by introducing additional knowledge are proposed and their effectiveness is shown by our preliminary experimental results.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130835552","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}
Acquisition methods of locations of mobile wireless nodes in wireless multihop networks are required to be developed for location-dependent network applications. Especially for indoor wireless networks, various location estimation methods without GPS devices has been proposed. However in most of the conventional methods, since location of each mobile wireless node is estimated independently of the others, neighbor relations among the nodes are not preserved in the set of their estimated locations. In addition, since multiple stationary wireless nodes whose locations have been determined are required, it is impossible for the conventional methods to be applied to MANETs (mobile ad-hoc networks). This paper proposes a novel location estimation method whose estimated locations preserve the neighbor relations among nodes by applying 2-step location estimation in which a sequence of wireless nodes is estimated based on the neighbor relations before locations are estimated and which does not require stationary wireless nodes by estimation of relative locations among the wireless nodes. The proposed method is now only adapted to 1-dimensional MANETs and will be extended to be applied to limited 2-dimensional MANETs such as slender and mesh types distribution of wireless nodes.
{"title":"Estimation of Ad Hoc Network Topology Preserving Neighbor Relations among Nodes","authors":"K. Itoh, H. Higaki","doi":"10.1109/ICCSA.2011.60","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.60","url":null,"abstract":"Acquisition methods of locations of mobile wireless nodes in wireless multihop networks are required to be developed for location-dependent network applications. Especially for indoor wireless networks, various location estimation methods without GPS devices has been proposed. However in most of the conventional methods, since location of each mobile wireless node is estimated independently of the others, neighbor relations among the nodes are not preserved in the set of their estimated locations. In addition, since multiple stationary wireless nodes whose locations have been determined are required, it is impossible for the conventional methods to be applied to MANETs (mobile ad-hoc networks). This paper proposes a novel location estimation method whose estimated locations preserve the neighbor relations among nodes by applying 2-step location estimation in which a sequence of wireless nodes is estimated based on the neighbor relations before locations are estimated and which does not require stationary wireless nodes by estimation of relative locations among the wireless nodes. The proposed method is now only adapted to 1-dimensional MANETs and will be extended to be applied to limited 2-dimensional MANETs such as slender and mesh types distribution of wireless nodes.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124930225","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}
In this paper, PCA based modeling of geometric structure of the face for automatic face detection is presented. The method improves the face detection rate and limits the search space. Skin Color Modeling (SCM) is one of the best face detection techniques for image and video. However, feature selection is very important for even better template matching performance in terms of detection rate and time. This paper presents an efficient feature extraction and selection method based on geometric structure of the facial image boundary and interior. To model the geometric structure of face, Principle Component Analysis (PCA) and canny edge detection are used. Fusion of PCA based geometric modeling and SCM method provides higher face detection accuracy and improves time complexity. Both models provide filtering of image in term of pixel values to get the face location that are very fast and efficient for large image databases.
{"title":"PCA Based Geometric Modeling for Automatic Face Detection","authors":"Padma Polash Paul, M. Gavrilova","doi":"10.1109/ICCSA.2011.69","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.69","url":null,"abstract":"In this paper, PCA based modeling of geometric structure of the face for automatic face detection is presented. The method improves the face detection rate and limits the search space. Skin Color Modeling (SCM) is one of the best face detection techniques for image and video. However, feature selection is very important for even better template matching performance in terms of detection rate and time. This paper presents an efficient feature extraction and selection method based on geometric structure of the facial image boundary and interior. To model the geometric structure of face, Principle Component Analysis (PCA) and canny edge detection are used. Fusion of PCA based geometric modeling and SCM method provides higher face detection accuracy and improves time complexity. Both models provide filtering of image in term of pixel values to get the face location that are very fast and efficient for large image databases.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134277209","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}
Jihn-Chang J. Jehng, Shihchieh Chou, Chin-Yi Cheng, J. Heh
In conventional approaches, documents are represented by the vector whose dimensionalities are equivalent to the terms extracted from a document set. These approaches, called bag-of-term approaches, ignore the conceptual relationships between terms such as synonyms, hypernyms and hyponyms. In the past, researches have applied thesauri such as Word Net to solve this problem. However, thesauri such as Word Net are developed more for general purposes and are limited in specific domain. Therefore, an automatically built ontology for terms is desired. In our previous study, we proposed a method which applies formal concept analysis (FCA), an automatic ontology building method, to extract the term relationships from a document set, and then apply the extracted information as the ontology of terms to represent the documents as concept vectors. In order to evaluate the usability and effectiveness of the proposed method for information retrieval related applications, we employed the concept vectors generated for the documents to the document clustering. In this study, we apply bisecting k-means clustering and hierarchical agglomerative clustering as the platforms with which to evaluate our method.
{"title":"An Evaluation of the Formal Concept Analysis-Based Document Vector on Document Clustering","authors":"Jihn-Chang J. Jehng, Shihchieh Chou, Chin-Yi Cheng, J. Heh","doi":"10.1109/ICCSA.2011.57","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.57","url":null,"abstract":"In conventional approaches, documents are represented by the vector whose dimensionalities are equivalent to the terms extracted from a document set. These approaches, called bag-of-term approaches, ignore the conceptual relationships between terms such as synonyms, hypernyms and hyponyms. In the past, researches have applied thesauri such as Word Net to solve this problem. However, thesauri such as Word Net are developed more for general purposes and are limited in specific domain. Therefore, an automatically built ontology for terms is desired. In our previous study, we proposed a method which applies formal concept analysis (FCA), an automatic ontology building method, to extract the term relationships from a document set, and then apply the extracted information as the ontology of terms to represent the documents as concept vectors. In order to evaluate the usability and effectiveness of the proposed method for information retrieval related applications, we employed the concept vectors generated for the documents to the document clustering. In this study, we apply bisecting k-means clustering and hierarchical agglomerative clustering as the platforms with which to evaluate our method.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115096602","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 proposed work gives novel technique to exploit the cloud for the purpose of qualitative improvement in services being rendered. In this context a service level agreement is executed between the service provider and the user incorporating stipulations regarding terms & conditions relevant with the transactions. Agreement envisages the provisioning of services to the users at the appointed time and charges commensurate with the market scenario. Besides the interests of the service providers are equally watched upon by allowing negotiations and settlements at par with prevailing market trends, thus ensuring benefits to both the service providers and the users. The scheduler algorithm allows re-provisioning of resources on the cloud in the event of failures. The focus of the model is to provide fair deal to the users and consumers, enhanced quality of service as well as generation of optimal revenue.
{"title":"SLA Based Scheduler for Cloud for Storage & Computational Services","authors":"Ravin Ahuja, Asok De, G. Gabrani","doi":"10.1109/ICCSA.2011.68","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.68","url":null,"abstract":"The proposed work gives novel technique to exploit the cloud for the purpose of qualitative improvement in services being rendered. In this context a service level agreement is executed between the service provider and the user incorporating stipulations regarding terms & conditions relevant with the transactions. Agreement envisages the provisioning of services to the users at the appointed time and charges commensurate with the market scenario. Besides the interests of the service providers are equally watched upon by allowing negotiations and settlements at par with prevailing market trends, thus ensuring benefits to both the service providers and the users. The scheduler algorithm allows re-provisioning of resources on the cloud in the event of failures. The focus of the model is to provide fair deal to the users and consumers, enhanced quality of service as well as generation of optimal revenue.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114576755","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}
R. Ipanaqué, Arnulfo Sandoval, Henry Giuseppe Sosa, A. Iglesias
Intervals play a pivotal role in both theoretical mathematics and applied mathematics. As a consequence, interval computation is becoming increasingly used in several fields of Mathematics and other applied sciences. However, only a few computer programs include specialized tools and libraries for interval computation so far. In this paper we describe a new package for dealing with single-valued interval computation on real numbers. The package, developed by the authors in free ware program Maxima, version 5.23.2, allows the user to manipulate single-valued real and extended intervals and carry out the most typical set operations on intervals (such as union, intersection and difference) in a smoothly and user-friendly way. The main features of our package are discussed throughout the paper. Several illustrative examples, aimed to show the good performance of the package, are also given.
{"title":"New Package in Maxima for Single-Valued Interval Computation on Real Numbers","authors":"R. Ipanaqué, Arnulfo Sandoval, Henry Giuseppe Sosa, A. Iglesias","doi":"10.1109/ICCSA.2011.32","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.32","url":null,"abstract":"Intervals play a pivotal role in both theoretical mathematics and applied mathematics. As a consequence, interval computation is becoming increasingly used in several fields of Mathematics and other applied sciences. However, only a few computer programs include specialized tools and libraries for interval computation so far. In this paper we describe a new package for dealing with single-valued interval computation on real numbers. The package, developed by the authors in free ware program Maxima, version 5.23.2, allows the user to manipulate single-valued real and extended intervals and carry out the most typical set operations on intervals (such as union, intersection and difference) in a smoothly and user-friendly way. The main features of our package are discussed throughout the paper. Several illustrative examples, aimed to show the good performance of the package, are also given.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126925182","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}
We present a system for hap tic interaction using multi-contact collision-detection algorithms. The architecture and modular structure of the system allows us not only to experiment with various algorithms, but also use them simultaneously. The system is based primarily on SNCH (Spatialized Normal Cone Hierarchies) algorithm, which we improved to achieve better stability. We also implemented a point-shell versus voxel grid collision detection and other algorithms can be included easily as well. This allows us, for example, to detect collisions with the main parts of the scene using the precise SNCH algorithm and roughly voxelize the non-critical parts so they can be tested differently to achieve higher speeds in runtime or in preprocessing. The system supports 6-DoF haptic devices and uses virtual coupling and physical simulation of the haptic tools to improve haptic interaction.
我们提出了一个使用多接触碰撞检测算法的碰撞相互作用系统。系统的架构和模块化结构使我们不仅可以实验各种算法，而且可以同时使用它们。该系统主要基于SNCH (Spatialized Normal Cone Hierarchies)算法，我们对其进行了改进以获得更好的稳定性。我们还实现了点壳与体素网格的碰撞检测，其他算法也可以很容易地包含进来。例如，这允许我们使用精确的SNCH算法检测与场景主要部分的碰撞，并大致体素化非关键部分，以便它们可以进行不同的测试，以在运行时或预处理中实现更高的速度。该系统支持六自由度触觉设备，并利用触觉工具的虚拟耦合和物理仿真来提高触觉交互性。
{"title":"Modular System for Haptic Interaction with Multi-contact Collision Detection","authors":"V. Kovalcík, Lukás Kalcok, Jirí Sochor","doi":"10.1109/ICCSA.2011.27","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.27","url":null,"abstract":"We present a system for hap tic interaction using multi-contact collision-detection algorithms. The architecture and modular structure of the system allows us not only to experiment with various algorithms, but also use them simultaneously. The system is based primarily on SNCH (Spatialized Normal Cone Hierarchies) algorithm, which we improved to achieve better stability. We also implemented a point-shell versus voxel grid collision detection and other algorithms can be included easily as well. This allows us, for example, to detect collisions with the main parts of the scene using the precise SNCH algorithm and roughly voxelize the non-critical parts so they can be tested differently to achieve higher speeds in runtime or in preprocessing. The system supports 6-DoF haptic devices and uses virtual coupling and physical simulation of the haptic tools to improve haptic interaction.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121439320","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}
Flavio Vella, Riccardo M. Cefalá, A. Costantini, O. Gervasi, C. Tanci
Recently GPU computing, namely the possibility to use the vector processors of graphics card as computational general purpose units of High Performance Computing environments, has generated considerable interest in the scientific community. Some communities in European Grid Infrastructure (EGI) are reshaping their applications to exploit this new programming paradigm. Each EGI community, called Virtual Organization (VO), often requires specific environments, making necessary for each Grid site to enable an efficient system to fulfill VO's software requirements. Cloud Computing and more generally the opportunity to transparently use computational resources, together with the consolidation of virtualization technologies, allows to provide to the end users the required environment for their activities. The present work is aimed at exploring the possibilities to provide for each VO an on-demand GPU environment (GPU framework, Operating System and libraries) and making it accessible via the EGI infrastructure using a Cloud approach.
{"title":"GPU Computing in EGI Environment Using a Cloud Approach","authors":"Flavio Vella, Riccardo M. Cefalá, A. Costantini, O. Gervasi, C. Tanci","doi":"10.1109/ICCSA.2011.61","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.61","url":null,"abstract":"Recently GPU computing, namely the possibility to use the vector processors of graphics card as computational general purpose units of High Performance Computing environments, has generated considerable interest in the scientific community. Some communities in European Grid Infrastructure (EGI) are reshaping their applications to exploit this new programming paradigm. Each EGI community, called Virtual Organization (VO), often requires specific environments, making necessary for each Grid site to enable an efficient system to fulfill VO's software requirements. Cloud Computing and more generally the opportunity to transparently use computational resources, together with the consolidation of virtualization technologies, allows to provide to the end users the required environment for their activities. The present work is aimed at exploring the possibilities to provide for each VO an on-demand GPU environment (GPU framework, Operating System and libraries) and making it accessible via the EGI infrastructure using a Cloud approach.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132767738","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}
We can obtain degeneracy conditions of singularities and the singular-discriminant of the quartic curve by using the elimination theory of the polynomial ideal. In this paper, we show the calculation results.
利用多项式理想的消去理论，得到了四次曲线奇异点的退化条件和奇异判别式。本文给出了计算结果。
{"title":"A Note on the Application of Elimination Ideal","authors":"Tadashi Takahashi","doi":"10.1109/ICCSA.2011.42","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.42","url":null,"abstract":"We can obtain degeneracy conditions of singularities and the singular-discriminant of the quartic curve by using the elimination theory of the polynomial ideal. In this paper, we show the calculation results.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132267823","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}
Miguel Castro, Agustín Guillén, J. L. Fuster, A. Jara, M. A. Zamora, A. Gómez-Skarmeta
Supply chain processes are being redefined and enhanced with the use of technologies based on the Internet of Things. This work presents an example of as an industrial process such as oxygen cylinders refilling and evaluation is enhanced with the use of the technologies from the Internet of Things such as RFID and 6LoWPAN, defining novel services which bring closer the industrial world to the Future Internet. Right now, the management of the oxygen cylinders is a simple task, where only some information about the oxygen cylinder is retrieved and manually managed by the operator. In this work is proposed a management application architecture for, on the one hand, automatic oxygen cylinders identification and classification, satisfying both traceability and monitoring requirements during the production process, and on the other hand, defining new management services to the operator, and for the checking of status and reception of notifications to the customer. In order to reach this, oxygen cylinders have been RFID tagged, and a Wireless Personal Device has been developed, in order to offer 6LoWPAN connectivity and an intuitive LCD touch screen for interacting with the RFID-HF reader.
{"title":"Oxygen Cylinders Management Architecture Based on Internet of Things","authors":"Miguel Castro, Agustín Guillén, J. L. Fuster, A. Jara, M. A. Zamora, A. Gómez-Skarmeta","doi":"10.1109/ICCSA.2011.67","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.67","url":null,"abstract":"Supply chain processes are being redefined and enhanced with the use of technologies based on the Internet of Things. This work presents an example of as an industrial process such as oxygen cylinders refilling and evaluation is enhanced with the use of the technologies from the Internet of Things such as RFID and 6LoWPAN, defining novel services which bring closer the industrial world to the Future Internet. Right now, the management of the oxygen cylinders is a simple task, where only some information about the oxygen cylinder is retrieved and manually managed by the operator. In this work is proposed a management application architecture for, on the one hand, automatic oxygen cylinders identification and classification, satisfying both traceability and monitoring requirements during the production process, and on the other hand, defining new management services to the operator, and for the checking of status and reception of notifications to the customer. In order to reach this, oxygen cylinders have been RFID tagged, and a Wireless Personal Device has been developed, in order to offer 6LoWPAN connectivity and an intuitive LCD touch screen for interacting with the RFID-HF reader.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114066324","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
扫码关注我们
求助内容：
应助结果提醒方式：