Pub Date : 2014-06-27DOI: 10.1109/ICSESS.2014.6933715
Minjie Wu, Weiwei Wu, N. Tai, Hongyu Zhao, Jiawu Fan, N. Yuan
As application complexity continues to grow, using multicore processors has been proved to be an effective methodology to meet the ever-increasing processing demand across the industry association. The Master/Slave model, the Data Flow model and the OpenMP model are the three dominant models for parallel programming. In this paper, the first two models are briefly discussed while the OpenMP model is focused. Some factors (e.g. the number of threads, the scheduling strategy, the load balance, etc.) that affecting the execution performance of OpenMP programs were also studied in this paper. This paper presents a method of taking advantage of the OpenMP model to realize the image edge detection within the platform of TMS320C6678 DSP. The experimental results show that the OpenMP model has a better advantage on scalability and flexibility compared to the Master/Slave model and the Data Flow model. The best performance can be obtained when the number of threads is equal to the number of cores which are available within the platform. Under the circumstance of using the eight cores of TMS320C6678 DSP simultaneously, an image of 1024×768 pixels just needs 6.192ms to complete the edge detection. This result is impressive compared to the Master/Slave model's which saves 32.10% in time. Further more, if we use 1 to 8 cores, the respective execution time reduces resulting in the speedup approximately conforms to the Gustafson's law. In the case of 8 cores, the speedup reaches 7.233.
{"title":"Research on OpenMP model of the parallel programming technology for homogeneous multicore DSP","authors":"Minjie Wu, Weiwei Wu, N. Tai, Hongyu Zhao, Jiawu Fan, N. Yuan","doi":"10.1109/ICSESS.2014.6933715","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933715","url":null,"abstract":"As application complexity continues to grow, using multicore processors has been proved to be an effective methodology to meet the ever-increasing processing demand across the industry association. The Master/Slave model, the Data Flow model and the OpenMP model are the three dominant models for parallel programming. In this paper, the first two models are briefly discussed while the OpenMP model is focused. Some factors (e.g. the number of threads, the scheduling strategy, the load balance, etc.) that affecting the execution performance of OpenMP programs were also studied in this paper. This paper presents a method of taking advantage of the OpenMP model to realize the image edge detection within the platform of TMS320C6678 DSP. The experimental results show that the OpenMP model has a better advantage on scalability and flexibility compared to the Master/Slave model and the Data Flow model. The best performance can be obtained when the number of threads is equal to the number of cores which are available within the platform. Under the circumstance of using the eight cores of TMS320C6678 DSP simultaneously, an image of 1024×768 pixels just needs 6.192ms to complete the edge detection. This result is impressive compared to the Master/Slave model's which saves 32.10% in time. Further more, if we use 1 to 8 cores, the respective execution time reduces resulting in the speedup approximately conforms to the Gustafson's law. In the case of 8 cores, the speedup reaches 7.233.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"237 1","pages":"921-924"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78829002","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933758
Dongyue Zhou, Binjie Hu
Based on amplify-and-forward cooperative relay under frequency selective fading channels, in order to reduce the feedback load of OFDM-based wireless systems, a practical limited bits feedback precoding algorithm is proposed. Using matrix decomposition method, precoding matrices are designed. The source node precoding need only one precoding matrix per OFDM frame. Source precoder and relay precoder are jointly optimized and quantified. The precoding matrix index is fed back for Clustered subcarrier of OFDM. The algorithm achieves precoding matrices at source and relay nodes with limited feedback. Simulations indicate that the proposed method can improve bit-error-rate performance. The bit error rates are also compared with different relay number.
{"title":"A limited-feedback-based optimal precoding algorithm for OFDM multi-relay networks","authors":"Dongyue Zhou, Binjie Hu","doi":"10.1109/ICSESS.2014.6933758","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933758","url":null,"abstract":"Based on amplify-and-forward cooperative relay under frequency selective fading channels, in order to reduce the feedback load of OFDM-based wireless systems, a practical limited bits feedback precoding algorithm is proposed. Using matrix decomposition method, precoding matrices are designed. The source node precoding need only one precoding matrix per OFDM frame. Source precoder and relay precoder are jointly optimized and quantified. The precoding matrix index is fed back for Clustered subcarrier of OFDM. The algorithm achieves precoding matrices at source and relay nodes with limited feedback. Simulations indicate that the proposed method can improve bit-error-rate performance. The bit error rates are also compared with different relay number.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"62 1","pages":"1103-1106"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90734395","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933545
Litian Xiao, Mengyuan Li, M. Gu, Jiaguang Sun
The correctness verification of embedded control software has become an important research topic in embedded system field. The paper analyses the present situation on correctness verification of control software as well as the limitations of existing technologies. In order to the high reliability and high security requirements of control software, the paper proposes a hierarchical framework and architecture of control software (PLC program) verification. The framework combines the technologies of testing, model checking and theorem proving. The paper introduces the construction, flow and key elements of the architecture.
{"title":"A hierarchy framework on compositional verification for PLC software","authors":"Litian Xiao, Mengyuan Li, M. Gu, Jiaguang Sun","doi":"10.1109/ICSESS.2014.6933545","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933545","url":null,"abstract":"The correctness verification of embedded control software has become an important research topic in embedded system field. The paper analyses the present situation on correctness verification of control software as well as the limitations of existing technologies. In order to the high reliability and high security requirements of control software, the paper proposes a hierarchical framework and architecture of control software (PLC program) verification. The framework combines the technologies of testing, model checking and theorem proving. The paper introduces the construction, flow and key elements of the architecture.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"69 1","pages":"204-207"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89337188","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933651
Zhaoyang Sun, L. Mak, K. Mao, W. Tang, Ying Liu, Kuitong Xian, Zhimin Wang, Y. Sui
In applications such as target detection, domain knowledge of sensed data is often available. In this paper, we incorporate the available domain knowledge into clustering process and develop a knowledge-driven Mahalanobis distance-based ART (adaptive resonance theory) clustering algorithm. The strength of the knowledge-driven algorithm is that it can automatically determine the number of clusters with improved clustering results. The validity of the new algorithm has been verified on four artificial datasets. In addition, the algorithm has been adopted in our cognition-inspired target detection and classification system, where known target library and dispersion of feature or attributes are available.
{"title":"A knowledge-driven ART clustering algorithm","authors":"Zhaoyang Sun, L. Mak, K. Mao, W. Tang, Ying Liu, Kuitong Xian, Zhimin Wang, Y. Sui","doi":"10.1109/ICSESS.2014.6933651","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933651","url":null,"abstract":"In applications such as target detection, domain knowledge of sensed data is often available. In this paper, we incorporate the available domain knowledge into clustering process and develop a knowledge-driven Mahalanobis distance-based ART (adaptive resonance theory) clustering algorithm. The strength of the knowledge-driven algorithm is that it can automatically determine the number of clusters with improved clustering results. The validity of the new algorithm has been verified on four artificial datasets. In addition, the algorithm has been adopted in our cognition-inspired target detection and classification system, where known target library and dispersion of feature or attributes are available.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"645-648"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88053604","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933653
Xinhong Hei, Jinlong Zhang, Bin Wang, Haiyan Jin, Nasser Giacaman
In order to reduce the complexity of traditional multithreaded parallel programming, this paper explores a new task-based parallel programming using the Microsoft .NET Task Parallel Library (TPL). Firstly, this paper proposes a custom data partitioning optimization method to achieve an efficient data parallelism, and applies it to the matrix multiplication. The result of the application supports the custom data partitioning optimization method. Then we develop a task parallel application: Image Blender, and this application explains the efficiency and pitfall aspects associated with task parallelism. Finally, the paper analyzes the performance of our applications. Experiments results show that TPL can dramatically alleviate programmer burden and boost the performance of programs with its task-based parallel programming mechanism.
{"title":"Parallelization using task parallel library with task-based programming model","authors":"Xinhong Hei, Jinlong Zhang, Bin Wang, Haiyan Jin, Nasser Giacaman","doi":"10.1109/ICSESS.2014.6933653","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933653","url":null,"abstract":"In order to reduce the complexity of traditional multithreaded parallel programming, this paper explores a new task-based parallel programming using the Microsoft .NET Task Parallel Library (TPL). Firstly, this paper proposes a custom data partitioning optimization method to achieve an efficient data parallelism, and applies it to the matrix multiplication. The result of the application supports the custom data partitioning optimization method. Then we develop a task parallel application: Image Blender, and this application explains the efficiency and pitfall aspects associated with task parallelism. Finally, the paper analyzes the performance of our applications. Experiments results show that TPL can dramatically alleviate programmer burden and boost the performance of programs with its task-based parallel programming mechanism.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"2013 1","pages":"653-656"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88174707","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933539
Andlib Akhtar, Yasir Hafeez Motla, Hummara Aslam, Muhammad Jamal
Requirement change management is an important activity in software development. When we change our requirements it affects the other requirements of the system as well as the architecture of the system. It needs a proper approach which improves the requirement change management and its impact on architecture in a better way. In this paper a framework has been introduced which integrates the impact of requirement change in the software system by using Twin Peak Model. The expert review method is used to evaluate our research. This framework gives a better approach to measure the impact of a requirement change in the architecture of the system. Our research outcome is, to develop a framework by using Twin Peaks Model to analyze the changing requirement and gives the impact of these changes in requirements on software architecture designing. It will be helpful to manage changes in the software architecture.
{"title":"Role of requirement change in software architecture using Twin Peaks Model","authors":"Andlib Akhtar, Yasir Hafeez Motla, Hummara Aslam, Muhammad Jamal","doi":"10.1109/ICSESS.2014.6933539","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933539","url":null,"abstract":"Requirement change management is an important activity in software development. When we change our requirements it affects the other requirements of the system as well as the architecture of the system. It needs a proper approach which improves the requirement change management and its impact on architecture in a better way. In this paper a framework has been introduced which integrates the impact of requirement change in the software system by using Twin Peak Model. The expert review method is used to evaluate our research. This framework gives a better approach to measure the impact of a requirement change in the architecture of the system. Our research outcome is, to develop a framework by using Twin Peaks Model to analyze the changing requirement and gives the impact of these changes in requirements on software architecture designing. It will be helpful to manage changes in the software architecture.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"99 1","pages":"174-177"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85773185","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933774
Wen Li, Wenbo Wang, Xiaojun Jing, Jie Liu, Y. Tian, Wei Feng
In communication networks, the multi-constraint multicast communication is an important way to improve the efficiency of network operation and quality of service. Some heuristic algorithms are applied in solving multicast routing problem under multiple constraints, such as simulated annealing, genetic algorithm, ant colony algorithm and particle swarm optimization algorithm. However, these algorithms suffer from low convergence rate and high computational complexity in solving multi-constraint multicast routing problems. The glowworm swarm optimization (GSO) algorithm is a promising algorithm recently arisen, which can overcome such shortcomings. This paper proposes a GSO based multi-constraint multicast (GSO-MCM) algorithm, which can efficiently generate multicast routing tree to meet the multi-constraint requirements. The simulation result manifests that the GSO-MCM algorithm proposed in this paper performs well in searching, converging speed and adaptability scale.
{"title":"A glowworm swarm optimization based multi-constraint multicast tree spanning algorithm","authors":"Wen Li, Wenbo Wang, Xiaojun Jing, Jie Liu, Y. Tian, Wei Feng","doi":"10.1109/ICSESS.2014.6933774","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933774","url":null,"abstract":"In communication networks, the multi-constraint multicast communication is an important way to improve the efficiency of network operation and quality of service. Some heuristic algorithms are applied in solving multicast routing problem under multiple constraints, such as simulated annealing, genetic algorithm, ant colony algorithm and particle swarm optimization algorithm. However, these algorithms suffer from low convergence rate and high computational complexity in solving multi-constraint multicast routing problems. The glowworm swarm optimization (GSO) algorithm is a promising algorithm recently arisen, which can overcome such shortcomings. This paper proposes a GSO based multi-constraint multicast (GSO-MCM) algorithm, which can efficiently generate multicast routing tree to meet the multi-constraint requirements. The simulation result manifests that the GSO-MCM algorithm proposed in this paper performs well in searching, converging speed and adaptability scale.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"15 1","pages":"1166-1170"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88549418","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933744
Pengbo Yu, Xiaomei Wang, Hongyi Yu
In wireless communication, ARQ scheme plays an important role for the error control. The two basic ARQ schemes are the Selective Repeat ARQ and the Go-Back-N ARQ.GBN-ARQ scheme is easy to implemented while its throughput is proved to be not so perfect. On the other hand, SR-ARQ performs better than GBN-ARQ while its implementation is too complex. The two basic ARQ schemes cannot satisfy the requirement of the wireless communication. In this paper, an advanced ARQ scheme is proposed to solve the problem mentioned above. The correlative relationship of the key segments of the network data is used to recover the erroneous data. The proposed scheme is analyzed in theories and compared with the basic ARQ schemes by Matlab simulation on throughput performance. The simulation results show that the proposed scheme has a lower complexity than that of SR-ARQ and it has a better throughput performance than that of GBN-ARQ.
{"title":"A novel ARQ scheme applied to wireless communication","authors":"Pengbo Yu, Xiaomei Wang, Hongyi Yu","doi":"10.1109/ICSESS.2014.6933744","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933744","url":null,"abstract":"In wireless communication, ARQ scheme plays an important role for the error control. The two basic ARQ schemes are the Selective Repeat ARQ and the Go-Back-N ARQ.GBN-ARQ scheme is easy to implemented while its throughput is proved to be not so perfect. On the other hand, SR-ARQ performs better than GBN-ARQ while its implementation is too complex. The two basic ARQ schemes cannot satisfy the requirement of the wireless communication. In this paper, an advanced ARQ scheme is proposed to solve the problem mentioned above. The correlative relationship of the key segments of the network data is used to recover the erroneous data. The proposed scheme is analyzed in theories and compared with the basic ARQ schemes by Matlab simulation on throughput performance. The simulation results show that the proposed scheme has a lower complexity than that of SR-ARQ and it has a better throughput performance than that of GBN-ARQ.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"1044-1047"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80005395","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933601
You Zhou, Guodong Lv, Baoxin Xiu, Weiming Zhang, Qing Cheng
The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(20.59n)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n2) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programming phases are shown in detail.
{"title":"A faster approximate method to identify minimum dominating set","authors":"You Zhou, Guodong Lv, Baoxin Xiu, Weiming Zhang, Qing Cheng","doi":"10.1109/ICSESS.2014.6933601","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933601","url":null,"abstract":"The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(20.59n)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n2) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programming phases are shown in detail.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"284 1","pages":"443-448"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77077058","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933632
Chenqi Bao, A. Flueck, Jianmin Bao, Xuan Shen
Visualization is critical in power systems engineering since the gigantic amount of data generated by power systems is difficult, and at times impossible, to be analyzed numerically. Therefore, the need for powerful visualization software has been increasingly acute due to the growth in size of power system models. To improve PPV's performance in order to accompany larger systems, this paper focuses on the development of PPV (Perfect Power Visualization), a 2-D power system visualization software program that processes and converts numerical data to graphic symbols based on their types, positions and states. The goal of PPV is to let operators visualize and interact with large-scale power systems in a consumer lever personal computer in real time. Also, it was optimized again with smarter data management systems, refinement of overall structure, and a newer platform that enables GPU acceleration, all of which further increased the performance of PPV by a factor of ten times that of its initial capabilities.
{"title":"Perfect power visualization-performance optimization with Java","authors":"Chenqi Bao, A. Flueck, Jianmin Bao, Xuan Shen","doi":"10.1109/ICSESS.2014.6933632","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933632","url":null,"abstract":"Visualization is critical in power systems engineering since the gigantic amount of data generated by power systems is difficult, and at times impossible, to be analyzed numerically. Therefore, the need for powerful visualization software has been increasingly acute due to the growth in size of power system models. To improve PPV's performance in order to accompany larger systems, this paper focuses on the development of PPV (Perfect Power Visualization), a 2-D power system visualization software program that processes and converts numerical data to graphic symbols based on their types, positions and states. The goal of PPV is to let operators visualize and interact with large-scale power systems in a consumer lever personal computer in real time. Also, it was optimized again with smarter data management systems, refinement of overall structure, and a newer platform that enables GPU acceleration, all of which further increased the performance of PPV by a factor of ten times that of its initial capabilities.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"49 1","pages":"569-572"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81502017","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
扫码关注我们
求助内容：
应助结果提醒方式：