Drowsiness is the main factors in traffic accidents because the ability of vehicle driver was diminished. These conditions will endanger to own driver and the other vehicle drivers. With the growing traffic conditions this problem will increase in the future. So, it is important to develop automatic characterization of the drowsiness stage. The aim of this paper presents a new method to improve wavelet coefficient of DWT for classification alert and drowsiness stages of EEG signals. The method applied the Parseval's theorem and energy coefficient distribution. The Input-Output cluster method was used to estimate the approximate status of each input features. Then these improve features are feeded into neural network classifier. The proposed method gets 90.27% of accuracy. The experimental results have shown that the proposed approach can achieve better performance in comparison with other based methods.
{"title":"Classification of Drowsiness in EEG Records Based on Energy Distribution and Wavelet-Neural Network","authors":"Naiyana Boonnak, Suwatchai Kamonsantiroj, Luepol Pipanmaekaporn","doi":"10.1109/CSE.2014.306","DOIUrl":"https://doi.org/10.1109/CSE.2014.306","url":null,"abstract":"Drowsiness is the main factors in traffic accidents because the ability of vehicle driver was diminished. These conditions will endanger to own driver and the other vehicle drivers. With the growing traffic conditions this problem will increase in the future. So, it is important to develop automatic characterization of the drowsiness stage. The aim of this paper presents a new method to improve wavelet coefficient of DWT for classification alert and drowsiness stages of EEG signals. The method applied the Parseval's theorem and energy coefficient distribution. The Input-Output cluster method was used to estimate the approximate status of each input features. Then these improve features are feeded into neural network classifier. The proposed method gets 90.27% of accuracy. The experimental results have shown that the proposed approach can achieve better performance in comparison with other based methods.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132791523","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}
Jian Li, Hanyi Du, Yingru Liu, Kai Zhang, Hui Zhou
In recent years, many vehicle detection algorithms have been proposed. However, a lot of challenges still remain. Local Binary Pattern (LBP) is one of the most popular texture descriptors which has shown its superiority in face recognition and pedestrian detection. But the original LBP pattern is sensitive to noise especially in flat region where gray levels change rarely. To solve this problem, Local Ternary Pattern (LTP) is proposed. Nevertheless, LBP and LTP are lack of gradient information. In this paper, after analysis and comparison, we propose a novel feature descriptor named Extended Gradient Local Ternary Pattern (EGLTP). The proposed descriptor, Extended Gradient Local Ternary Pattern (EGLTP), contains properties of other features, such as the original LTP being less sensitive to noise, Semantic Local Binary Patterns (S-LBP) having low complexity and good direction property, and HOG including lots of gradient information. Experiments showed that EGLTP feature is very discriminative and robust in comparison with other features.
{"title":"Extended Gradient Local Ternary Pattern for Vehicle Detection","authors":"Jian Li, Hanyi Du, Yingru Liu, Kai Zhang, Hui Zhou","doi":"10.1109/CSE.2014.345","DOIUrl":"https://doi.org/10.1109/CSE.2014.345","url":null,"abstract":"In recent years, many vehicle detection algorithms have been proposed. However, a lot of challenges still remain. Local Binary Pattern (LBP) is one of the most popular texture descriptors which has shown its superiority in face recognition and pedestrian detection. But the original LBP pattern is sensitive to noise especially in flat region where gray levels change rarely. To solve this problem, Local Ternary Pattern (LTP) is proposed. Nevertheless, LBP and LTP are lack of gradient information. In this paper, after analysis and comparison, we propose a novel feature descriptor named Extended Gradient Local Ternary Pattern (EGLTP). The proposed descriptor, Extended Gradient Local Ternary Pattern (EGLTP), contains properties of other features, such as the original LTP being less sensitive to noise, Semantic Local Binary Patterns (S-LBP) having low complexity and good direction property, and HOG including lots of gradient information. Experiments showed that EGLTP feature is very discriminative and robust in comparison with other features.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131197271","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}
Image in painting has been a popular study point in recent years and a number of strategies have been developed. Partial differential equation (PDE) image in painting approach often acts as a fundamental building block in this area. However, the high computing load limits the application of PDE-based image in painting, especially in mobile terminal. In this paper, first an enhanced Curvature-Driven Diffusions (ECDD) model is proposed to improve the repairing performance. Then a fast local non-texture in painting scheme is performed based on ECDD and total variation (TV) to make the computing of the PDE-based image in painting more efficient. The experimental results show that the proposed strategy not only can repair the long disconnected objects more accurately, but also can greatly shorten the iteration time of image in painting.
{"title":"Highly Efficient Local Non-Texture Image Inpainting Based on Partial Differential Equation","authors":"Chuang Zhu, Huizhu Jia, Meng Li, Xiaofeng Huang, Xiaodong Xie","doi":"10.1109/CSE.2014.164","DOIUrl":"https://doi.org/10.1109/CSE.2014.164","url":null,"abstract":"Image in painting has been a popular study point in recent years and a number of strategies have been developed. Partial differential equation (PDE) image in painting approach often acts as a fundamental building block in this area. However, the high computing load limits the application of PDE-based image in painting, especially in mobile terminal. In this paper, first an enhanced Curvature-Driven Diffusions (ECDD) model is proposed to improve the repairing performance. Then a fast local non-texture in painting scheme is performed based on ECDD and total variation (TV) to make the computing of the PDE-based image in painting more efficient. The experimental results show that the proposed strategy not only can repair the long disconnected objects more accurately, but also can greatly shorten the iteration time of image in painting.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131691633","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}
To detect and resolve distributed deadlocks in the generalized model, a few algorithms have been proposed. Most of them are distributed algorithms which are based on the diffusing computation technique where propagation of probes and backward propagation of replies are required. On the contrary, centralized algorithms send the dependency information directly to the initiator. However, existing algorithms do not distinguish local deadlocks from global deadlocks. In this paper, we present a semi-centralized algorithm which effectively detects and resolves local deadlocks prior to global deadlocks. To be specific, a consistent snapshot of dependency information of involved nodes is recorded in an information table at each site. Therefore, the detection and resolution of local deadlocks can be performed at each site before the dependency information is sent to the initiator to further detect global deadlocks. The proposed algorithm also handles the problem of phantom edges and concurrent executions. Performance analysis shows that the performance of our algorithm is close to or better than that of the existing algorithms in terms of execution time, message traffic and message size.
{"title":"A Semi-centralized Algorithm to Detect and Resolve Distributed Deadlocks in the Generalized Model","authors":"Zhihong Tao, Hui Li, Bing Zhu, Yunmin Wang","doi":"10.1109/CSE.2014.152","DOIUrl":"https://doi.org/10.1109/CSE.2014.152","url":null,"abstract":"To detect and resolve distributed deadlocks in the generalized model, a few algorithms have been proposed. Most of them are distributed algorithms which are based on the diffusing computation technique where propagation of probes and backward propagation of replies are required. On the contrary, centralized algorithms send the dependency information directly to the initiator. However, existing algorithms do not distinguish local deadlocks from global deadlocks. In this paper, we present a semi-centralized algorithm which effectively detects and resolves local deadlocks prior to global deadlocks. To be specific, a consistent snapshot of dependency information of involved nodes is recorded in an information table at each site. Therefore, the detection and resolution of local deadlocks can be performed at each site before the dependency information is sent to the initiator to further detect global deadlocks. The proposed algorithm also handles the problem of phantom edges and concurrent executions. Performance analysis shows that the performance of our algorithm is close to or better than that of the existing algorithms in terms of execution time, message traffic and message size.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127393908","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}
Present NoSQL databases are passive entities, where users proactively access the databases serving requested issued by users. While NoSQL databases are scalable due to their horizontal scale-out designs, data items stored in potentially very large databases are difficult to retrieve in terms of access delay, programmability and usability. In this paper, we advocate supporting events in NoSQL. By introducing publishers and subscribers to NoSQL, our proposed NoSQL data store is capable of proactively delivering data items that users are interested in. Additionally, our NoSQL database decouples publishers and subscribers such that application developers can emphasize on data manipulation without paying attention to communications for delivering data. We formally discuss the design requirements for streaming in NoSQL, and present a prototype implementation that addresses the design issues. Our implementation is then benchmarked, and the performance results are discussed. We finally outline potential enhancements to our proposal in this paper.
{"title":"Publish/Subscribe in NoSQL","authors":"Chia-Ping Tsai, Kuo-Yu Yang, Jui-Yu Hsieh, Hung-Chang Hsiao, Ching-Hsien Hsu","doi":"10.1109/CSE.2014.227","DOIUrl":"https://doi.org/10.1109/CSE.2014.227","url":null,"abstract":"Present NoSQL databases are passive entities, where users proactively access the databases serving requested issued by users. While NoSQL databases are scalable due to their horizontal scale-out designs, data items stored in potentially very large databases are difficult to retrieve in terms of access delay, programmability and usability. In this paper, we advocate supporting events in NoSQL. By introducing publishers and subscribers to NoSQL, our proposed NoSQL data store is capable of proactively delivering data items that users are interested in. Additionally, our NoSQL database decouples publishers and subscribers such that application developers can emphasize on data manipulation without paying attention to communications for delivering data. We formally discuss the design requirements for streaming in NoSQL, and present a prototype implementation that addresses the design issues. Our implementation is then benchmarked, and the performance results are discussed. We finally outline potential enhancements to our proposal in this paper.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115325031","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}
How to provide both security and privacy in communication networks has been an important issue for ubiquitous computing. Especially, user authentication in the current IT services has become one of important security issues. However, the security weaknesses in the user authentication have been exposed seriously due to the careless secret related information management and the sophisticated attack techniques. Recently, an enhanced biometric-based user authentication protocol is proposed by An, which uses three factors, password, smart card and biometrics. However, this paper shows that An's protocol has weaknesses in the password guessing attack and the lack of privacy support if an attacker could get user's smart card, could read on it and could intercept session messages between user and server. Furthermore, this paper proposes a privacy preserving biometric-based user authentication protocol using smart card, which could solve the overall problems in An's protocol and even put privacy considerations on it. The overall security analyses show that the proposed protocol achieves the desired security goals.
{"title":"Privacy Preserving Biometric-Based User Authentication Protocol Using Smart Cards","authors":"Minsu Park, Hyunsung Kim, Sung-Woon Lee","doi":"10.1109/CSE.2014.285","DOIUrl":"https://doi.org/10.1109/CSE.2014.285","url":null,"abstract":"How to provide both security and privacy in communication networks has been an important issue for ubiquitous computing. Especially, user authentication in the current IT services has become one of important security issues. However, the security weaknesses in the user authentication have been exposed seriously due to the careless secret related information management and the sophisticated attack techniques. Recently, an enhanced biometric-based user authentication protocol is proposed by An, which uses three factors, password, smart card and biometrics. However, this paper shows that An's protocol has weaknesses in the password guessing attack and the lack of privacy support if an attacker could get user's smart card, could read on it and could intercept session messages between user and server. Furthermore, this paper proposes a privacy preserving biometric-based user authentication protocol using smart card, which could solve the overall problems in An's protocol and even put privacy considerations on it. The overall security analyses show that the proposed protocol achieves the desired security goals.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115345449","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}
Owing to the nature of elastic resource pooling, cloud computing offers a great opportunity to extend the potentials of Mobile Devices (MDs) for supporting the resources-hungry applications. In the mobile cloud platforms, each MD is associated with a system-level clone in the cloud infrastructure. It provides the potentials in supporting the clone sharing. The clone sharing can reduce the communication delay between an MD and its clone when the MD moves far away from its clone. It is because that clone sharing can migrate the service from the remote source clone to a nearby target clone. Considering the mobility of MDs, how to select the appropriate target clone is still a big challenge. In this paper, we first pose the clone sharing question. The clone sharing can reduce the service delay between a MD and its clone when the MD move far away from its clone. It is because that it migrate the service from the remote source clone to a local target clone. However, how to select the appropriate target clone is a big challenge. We propose a clone sharing scheme, called as Triangulation-based Clone Sharing Scheme (TCS), to solve the problem. In the TCS scheme, we firstly disclose the relationship between clone serving area and the MD. Secondly, the TCS scheme splits the clone network into Triangle topology by our Clone Triangulation Topology Construction and Reconstruction (CTTCR) algorithm. It can accurately obtain the target clone for clone migration. We also prove the correctness of CTTCR algorithm. Simulation results show that our scheme works very well.
{"title":"Dynamic Clone Sharing Scheme in Mobile Cloud Computing: A Delaunay Triangulation Approach","authors":"Zhen Yang, Xing Liu","doi":"10.1109/CSE.2014.252","DOIUrl":"https://doi.org/10.1109/CSE.2014.252","url":null,"abstract":"Owing to the nature of elastic resource pooling, cloud computing offers a great opportunity to extend the potentials of Mobile Devices (MDs) for supporting the resources-hungry applications. In the mobile cloud platforms, each MD is associated with a system-level clone in the cloud infrastructure. It provides the potentials in supporting the clone sharing. The clone sharing can reduce the communication delay between an MD and its clone when the MD moves far away from its clone. It is because that clone sharing can migrate the service from the remote source clone to a nearby target clone. Considering the mobility of MDs, how to select the appropriate target clone is still a big challenge. In this paper, we first pose the clone sharing question. The clone sharing can reduce the service delay between a MD and its clone when the MD move far away from its clone. It is because that it migrate the service from the remote source clone to a local target clone. However, how to select the appropriate target clone is a big challenge. We propose a clone sharing scheme, called as Triangulation-based Clone Sharing Scheme (TCS), to solve the problem. In the TCS scheme, we firstly disclose the relationship between clone serving area and the MD. Secondly, the TCS scheme splits the clone network into Triangle topology by our Clone Triangulation Topology Construction and Reconstruction (CTTCR) algorithm. It can accurately obtain the target clone for clone migration. We also prove the correctness of CTTCR algorithm. Simulation results show that our scheme works very well.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115373564","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}
Line drawing can express meaningful information by ignoring less important or distracting details, and thus becomes a popular shape depiction technique. However, existing methods mainly focused on static data. Although we can apply these methods to animated data frame by frame, it is still not applicable for large scale model due to the high computational cost. In this paper, we present a real time line drawing method for skinned mesh. We exploit the surface normal coherency between neighbouring frames to accelerate the computation of surface normal which is the bottleneck of most line drawing methods. The experimental results show that our method is both efficient and effective.
{"title":"Realtime Illustrative Rendering of Large Scale Skinned Meshes","authors":"Juncong Lin, Guangyu Zhang, Xing Gao, Minghong Liao, Lisheng Xiang","doi":"10.1109/CSE.2014.326","DOIUrl":"https://doi.org/10.1109/CSE.2014.326","url":null,"abstract":"Line drawing can express meaningful information by ignoring less important or distracting details, and thus becomes a popular shape depiction technique. However, existing methods mainly focused on static data. Although we can apply these methods to animated data frame by frame, it is still not applicable for large scale model due to the high computational cost. In this paper, we present a real time line drawing method for skinned mesh. We exploit the surface normal coherency between neighbouring frames to accelerate the computation of surface normal which is the bottleneck of most line drawing methods. The experimental results show that our method is both efficient and effective.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342259","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}
Kebin Hu, Xiaoling Zhang, Wen-Jun Wu, Jun Shi, Shunjun Wei
Back projection (BP) algorithm has the ability of accurate imaging for synthetic aperture radar (SAR). However, the drawback of low computational efficiency limits the wide application of BP. In this paper, three different parallel schemes based on GPU for BP are presented. According to the features of serial structure of BP, the first two schemes are parallelized through mapping the pulse repetition intervals (PRIs) and pixels in the scene onto the parallel threads in GPU, respectively, another scheme combines the first two schemes together. In order to select the best scheme for application, we also provide a coarse criterion after detailed analysis of the three schemes from aspects of parallelization degree, memory occupancy and memory access efficiency. The simulation results are carried out and compared, which validates the efficacy of the three schemes.
{"title":"Three GPU-Based Parallel Schemes for SAR Back Projection Imaging Algorithm","authors":"Kebin Hu, Xiaoling Zhang, Wen-Jun Wu, Jun Shi, Shunjun Wei","doi":"10.1109/CSE.2014.87","DOIUrl":"https://doi.org/10.1109/CSE.2014.87","url":null,"abstract":"Back projection (BP) algorithm has the ability of accurate imaging for synthetic aperture radar (SAR). However, the drawback of low computational efficiency limits the wide application of BP. In this paper, three different parallel schemes based on GPU for BP are presented. According to the features of serial structure of BP, the first two schemes are parallelized through mapping the pulse repetition intervals (PRIs) and pixels in the scene onto the parallel threads in GPU, respectively, another scheme combines the first two schemes together. In order to select the best scheme for application, we also provide a coarse criterion after detailed analysis of the three schemes from aspects of parallelization degree, memory occupancy and memory access efficiency. The simulation results are carried out and compared, which validates the efficacy of the three schemes.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114564761","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}
I. Perikos, P. Angelopoulos, M. Paraskevas, T. Zarouchas, Giannis Tzimas
This study presents the utilization of a Hybrid Education Platform for the realization of a versatile blended learning model oriented to computer engineering and science educators. Furthermore, a data mining approach is introduced to analyze the questionnaires that learners submit concerning the learning activities they have participated in. Specifically, a clustering and classification methodology framework is followed in order to efficiently examine and extract behavioral trends of the participants. Preliminary results indicate the robustness of the proposed methodology scheme which can potential be applied to various evaluation tasks.
{"title":"A Methodology for Evaluation and Knowledge Extraction from On-going Learning Process","authors":"I. Perikos, P. Angelopoulos, M. Paraskevas, T. Zarouchas, Giannis Tzimas","doi":"10.1109/CSE.2014.106","DOIUrl":"https://doi.org/10.1109/CSE.2014.106","url":null,"abstract":"This study presents the utilization of a Hybrid Education Platform for the realization of a versatile blended learning model oriented to computer engineering and science educators. Furthermore, a data mining approach is introduced to analyze the questionnaires that learners submit concerning the learning activities they have participated in. Specifically, a clustering and classification methodology framework is followed in order to efficiently examine and extract behavioral trends of the participants. Preliminary results indicate the robustness of the proposed methodology scheme which can potential be applied to various evaluation tasks.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"33 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123233297","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
扫码关注我们
求助内容：
应助结果提醒方式：