Pub Date : 2013-11-11DOI: 10.1109/CEEC.2013.6659442
Aruna Shenoy, N. Davey, R. Frank
This paper discusses various biologically plausible computational models that recognize human facial expression and analyze them. Identifying facial expressions is a non trivial task for a human and is a key part of social interactions. However, it is not as simple as that for a computational system. Here we analyze six different universally accepted facial expressions for analysis with the aid of six biologically plausible computational models.
{"title":"Biologically plausible computational models for facial expression recognition","authors":"Aruna Shenoy, N. Davey, R. Frank","doi":"10.1109/CEEC.2013.6659442","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659442","url":null,"abstract":"This paper discusses various biologically plausible computational models that recognize human facial expression and analyze them. Identifying facial expressions is a non trivial task for a human and is a key part of social interactions. However, it is not as simple as that for a computational system. Here we analyze six different universally accepted facial expressions for analysis with the aid of six biologically plausible computational models.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123772556","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659467
B. Alzahrani, V. Vassilakis, M. Reed
Information Centric Network is a brand new architecture that focuses on the information objects rather than the location of end users. It aims to replace the current end-to-end model with the publish-subscribe model to solve many issues including security, routing scalability, mobility. One of the main features in this network is the use of a simple and light multicast forwarding fabric, which is suitable for large-scale publish/subscribe. This routing system is very fast packet forwarding with small forwarding tables. It is also more energy efficient than the currently used ones. In this paper we enhance the security level of this mechanism and prevent malicious users from injecting traffic using brute force attacks, replay attacks and computational attacks. We propose and analyse two initial designs that mitigate these attacks.
{"title":"Securing the forwarding plane in information centric networks","authors":"B. Alzahrani, V. Vassilakis, M. Reed","doi":"10.1109/CEEC.2013.6659467","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659467","url":null,"abstract":"Information Centric Network is a brand new architecture that focuses on the information objects rather than the location of end users. It aims to replace the current end-to-end model with the publish-subscribe model to solve many issues including security, routing scalability, mobility. One of the main features in this network is the use of a simple and light multicast forwarding fabric, which is suitable for large-scale publish/subscribe. This routing system is very fast packet forwarding with small forwarding tables. It is also more energy efficient than the currently used ones. In this paper we enhance the security level of this mechanism and prevent malicious users from injecting traffic using brute force attacks, replay attacks and computational attacks. We propose and analyse two initial designs that mitigate these attacks.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126873088","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659463
M. Bakillah, A. Mobasheri, S. Liang, A. Zipf
The rapidly growing number of crowdsourcing platforms generates huge volumes of volunteered geographic information (VGI), which requires analysis to reveal their potential. The huge volumes of data appear as an opportunity to improve various applications, including routing and navigation services. How existing techniques for dealing with Big Data could be useful for the analysis of VGI remains an open question, since VGI differs from traditional data. In this paper, we focus on examining the latest developments and issues associated with big data from the perspective of the analysis of VGI. This paper notably presents our new architecture for exploiting Big VGI in event service processing in support to optimization of routing service. In addition, our study highlights the opportunities that are created by the emergence of Big VGI and crowdsourced data on improving routing and navigation services, as well as the challenges that remain to be addressed to make this a reality. Finally, avenues for future research on the next generation of collaborative routing and navigation services are presented.
{"title":"Towards an efficient routing web processing service through capturing real-time road conditions from big data","authors":"M. Bakillah, A. Mobasheri, S. Liang, A. Zipf","doi":"10.1109/CEEC.2013.6659463","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659463","url":null,"abstract":"The rapidly growing number of crowdsourcing platforms generates huge volumes of volunteered geographic information (VGI), which requires analysis to reveal their potential. The huge volumes of data appear as an opportunity to improve various applications, including routing and navigation services. How existing techniques for dealing with Big Data could be useful for the analysis of VGI remains an open question, since VGI differs from traditional data. In this paper, we focus on examining the latest developments and issues associated with big data from the perspective of the analysis of VGI. This paper notably presents our new architecture for exploiting Big VGI in event service processing in support to optimization of routing service. In addition, our study highlights the opportunities that are created by the emergence of Big VGI and crowdsourced data on improving routing and navigation services, as well as the challenges that remain to be addressed to make this a reality. Finally, avenues for future research on the next generation of collaborative routing and navigation services are presented.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124566661","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659435
Muhammad Waqas Khan, M. Choudhry, M. Zeeshan
In Heating, Ventilating and Air Conditioning (HVAC) systems, effective thermal management is required because energy and operation costs of buildings are directly influenced by how well an air-conditioning system performs. HVAC systems are typically nonlinear time varying with disturbances, where conventional PID controllers may trade-off between stability and rise time. To overcome this limitation, a Genetic Algorithm based Adaptive Fuzzy Logic Controller (AFLC) design has been proposed for the control of temperature and relative humidity of an experimental setup by manipulating valve positions to adjust the water and steam flow rates for Air Handling Unit (AHU). Modulating equal percentage Globe valves for chilled water and steam have been modeled according to exact flow rates of water and steam. A novel method for the adaptation of Fuzzy Logic Controller (FLC) by modifying Fuzzy Rule Matrix (FRM) based on Genetic Algorithm (GA) has been proposed. The proposed adaptive controller outperforms the existing fuzzy controller in terms of steady state error, rise time and settling time.
{"title":"An efficient design of genetic algorithm based Adaptive Fuzzy Logic Controller for multivariable control of HVAC systems","authors":"Muhammad Waqas Khan, M. Choudhry, M. Zeeshan","doi":"10.1109/CEEC.2013.6659435","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659435","url":null,"abstract":"In Heating, Ventilating and Air Conditioning (HVAC) systems, effective thermal management is required because energy and operation costs of buildings are directly influenced by how well an air-conditioning system performs. HVAC systems are typically nonlinear time varying with disturbances, where conventional PID controllers may trade-off between stability and rise time. To overcome this limitation, a Genetic Algorithm based Adaptive Fuzzy Logic Controller (AFLC) design has been proposed for the control of temperature and relative humidity of an experimental setup by manipulating valve positions to adjust the water and steam flow rates for Air Handling Unit (AHU). Modulating equal percentage Globe valves for chilled water and steam have been modeled according to exact flow rates of water and steam. A novel method for the adaptation of Fuzzy Logic Controller (FLC) by modifying Fuzzy Rule Matrix (FRM) based on Genetic Algorithm (GA) has been proposed. The proposed adaptive controller outperforms the existing fuzzy controller in terms of steady state error, rise time and settling time.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134559672","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659448
C. Yeh, D. Pycock
Mathematical morphology was developed for binary images and extended to grey-level images. To date there is no widely accepted extension of mathematical morphology to colour. We present a unifying concept for binary, grey-level and colour morphology introducing similarity measures to form classes of colour morphological operators. We define similarity criteria as the basis for mathematical morphology with flat and non-flat structuring elements. Results for dilation, erosion and hit-or-miss transforms on binary, grey-level and colour images are presented.
{"title":"Similarity colour morphology","authors":"C. Yeh, D. Pycock","doi":"10.1109/CEEC.2013.6659448","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659448","url":null,"abstract":"Mathematical morphology was developed for binary images and extended to grey-level images. To date there is no widely accepted extension of mathematical morphology to colour. We present a unifying concept for binary, grey-level and colour morphology introducing similarity measures to form classes of colour morphological operators. We define similarity criteria as the basis for mathematical morphology with flat and non-flat structuring elements. Results for dilation, erosion and hit-or-miss transforms on binary, grey-level and colour images are presented.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131062609","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659466
Hootan Zhian, M. Sabaei, N. T. Javan, Omid Tavallaie
Network coding is used to improve the throughput of communication networks. In this technique, the intermediate nodes mix packets to increase the information content of each transmission. For each flow, a coding pattern is defined as a set of flows that can be coded together. Finding a suitable coding pattern is a challenge due to much complexity. In this paper, we propose an algorithm to find a suitable coding pattern in intermediate nodes by mapping this problem onto maximum-weight clique. Also, we described time complexity of our algorithm in details. Simulation results show that our proposed method can achieve better performance in terms of throughput and end-to-end delay by increasing coding opportunities.
{"title":"Increasing coding opportunities using maximum-weight clique","authors":"Hootan Zhian, M. Sabaei, N. T. Javan, Omid Tavallaie","doi":"10.1109/CEEC.2013.6659466","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659466","url":null,"abstract":"Network coding is used to improve the throughput of communication networks. In this technique, the intermediate nodes mix packets to increase the information content of each transmission. For each flow, a coding pattern is defined as a set of flows that can be coded together. Finding a suitable coding pattern is a challenge due to much complexity. In this paper, we propose an algorithm to find a suitable coding pattern in intermediate nodes by mapping this problem onto maximum-weight clique. Also, we described time complexity of our algorithm in details. Simulation results show that our proposed method can achieve better performance in terms of throughput and end-to-end delay by increasing coding opportunities.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346303","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659464
Abdulbasit K. Al-Talabani, H. Sellahewa, S. Jassim
Emotion recognition is a challenging task with many applications in healthcare and human-machine interaction. In this study we propose to fuse two sets of features for emotion recognition at the classification level. A set of features that includes LPCC and MFCC extracted from LP-residual samples and Wavelet Octave Coefficient Of Residual (WOCOR) is proposed in this study as excitation source features. The proposed set of features is fused with 6552 LLDs using SVM and ANN classifiers. The experiments are tested on a newly acquired emotional speech database in Kurdish language, the Berlin emotional speech database, and the Aibo database. The experiments demonstrate that the fusion of the proposed excitation source features with the common LLDs can achieve better recognition accuracies than what is reported in the state-of-the-art studies.
{"title":"Excitation source and low level descriptor features fusion for emotion recognition using SVM and ANN","authors":"Abdulbasit K. Al-Talabani, H. Sellahewa, S. Jassim","doi":"10.1109/CEEC.2013.6659464","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659464","url":null,"abstract":"Emotion recognition is a challenging task with many applications in healthcare and human-machine interaction. In this study we propose to fuse two sets of features for emotion recognition at the classification level. A set of features that includes LPCC and MFCC extracted from LP-residual samples and Wavelet Octave Coefficient Of Residual (WOCOR) is proposed in this study as excitation source features. The proposed set of features is fused with 6552 LLDs using SVM and ANN classifiers. The experiments are tested on a newly acquired emotional speech database in Kurdish language, the Berlin emotional speech database, and the Aibo database. The experiments demonstrate that the fusion of the proposed excitation source features with the common LLDs can achieve better recognition accuracies than what is reported in the state-of-the-art studies.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125980488","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659437
Mahmoud El-Haj, Lorna Balkan, Suzanne Barbalet, L. Bell, J. Shepherdson
In this paper we present the tools, techniques and evaluation results of an automatic indexing experiment we conducted on the UK Data Archive/UK Data Service data-related document collection, as part of the Jisc-funded SKOS-HASSET project. We examined the quality of an automatic indexer based on a controlled vocabulary called the Humanities and Social Science Electronic Thesaurus (HASSET). We used the Keyphrase Extraction Algorithm (KEA), a text mining and a machine learning tool. KEA builds a classifier model using training documents with known keywords which is then applied to help assign keywords to new documents. We performed extensive manual and automatic evaluation on the results using recall, precision and F1 scores. The quality of the KEA indexing was measured a) automatically by the degree of overlap between the automated indexing decisions and those originally made by the human indexer and b) manually by comparing KEA's output with the source text. This paper explains how and why we applied the chosen technical solutions, and how we intend to take forward any lessons learned from this work in the future.
{"title":"An experiment in automatic indexing using the HASSET thesaurus","authors":"Mahmoud El-Haj, Lorna Balkan, Suzanne Barbalet, L. Bell, J. Shepherdson","doi":"10.1109/CEEC.2013.6659437","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659437","url":null,"abstract":"In this paper we present the tools, techniques and evaluation results of an automatic indexing experiment we conducted on the UK Data Archive/UK Data Service data-related document collection, as part of the Jisc-funded SKOS-HASSET project. We examined the quality of an automatic indexer based on a controlled vocabulary called the Humanities and Social Science Electronic Thesaurus (HASSET). We used the Keyphrase Extraction Algorithm (KEA), a text mining and a machine learning tool. KEA builds a classifier model using training documents with known keywords which is then applied to help assign keywords to new documents. We performed extensive manual and automatic evaluation on the results using recall, precision and F1 scores. The quality of the KEA indexing was measured a) automatically by the degree of overlap between the automated indexing decisions and those originally made by the human indexer and b) manually by comparing KEA's output with the source text. This paper explains how and why we applied the chosen technical solutions, and how we intend to take forward any lessons learned from this work in the future.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130181319","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659462
Intekhab Alam
Tracking of an object of interest is posed as a time varying problem and complexity of the tracking algorithm at any specific moment in time is dynamically adjusted based on the scene conditions as shown in fig 1. We have implemented kernel weighted discrete probability density function of the target color feature by using a Fuzzy Rule Based System. This technique based on Fuzzy Logic and Look-up tables not only facilitates near real time tracking in video feed but performs very competitively to the traditional mean shift algorithm which in its original form is very cumbersome to implement especially when a real time intervention is required for e.g. in surveillance or in safety critical applications where driving assistance is the prime objective. A centralized controller or supervisor utilizes Bhattacharyya quality control and standard conflict resolution techniques to decide the level of algorithmic complexity needed to resolve any potential differences of opinion that may arise among modules. By selecting appropriate loop as in the Fig 1 and hence the optimum level of information fusion our tracker becomes much more robust even during time spans when a large level of maneuverability is observed as compared to the traditional mean shift with an added advantage of real time capa.
{"title":"Object tracking in video sequences using information fusion principles. Meanshift kernel implementation using fuzzy rules","authors":"Intekhab Alam","doi":"10.1109/CEEC.2013.6659462","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659462","url":null,"abstract":"Tracking of an object of interest is posed as a time varying problem and complexity of the tracking algorithm at any specific moment in time is dynamically adjusted based on the scene conditions as shown in fig 1. We have implemented kernel weighted discrete probability density function of the target color feature by using a Fuzzy Rule Based System. This technique based on Fuzzy Logic and Look-up tables not only facilitates near real time tracking in video feed but performs very competitively to the traditional mean shift algorithm which in its original form is very cumbersome to implement especially when a real time intervention is required for e.g. in surveillance or in safety critical applications where driving assistance is the prime objective. A centralized controller or supervisor utilizes Bhattacharyya quality control and standard conflict resolution techniques to decide the level of algorithmic complexity needed to resolve any potential differences of opinion that may arise among modules. By selecting appropriate loop as in the Fig 1 and hence the optimum level of information fusion our tracker becomes much more robust even during time spans when a large level of maneuverability is observed as compared to the traditional mean shift with an added advantage of real time capa.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955962","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 : 2013-11-11DOI: 10.1109/CEEC.2013.6659451
J. H. Zheng, T. Ji, M. S. Li, Q. Wu, P. Wu
Constrained optimization problems play a significant role within optimization problems. In this paper, a novel method, decomposed unlimited point method (DUPM), is proposed to modify the Karush-Kuhn-Tucker (KKT) condition of constrained optimization problems. In the DUPM, KKT condition can be transformed into equations without any limitation in the variable space. Afterwards, the equivalent equations are solved by Levenberg-Marquardt method (LMM), which is the first attempt ever of applying LMM to such situations. Simulation results on various numerical examples demonstrate that DUPM is able to transform the primal KKT condition into equations without changing the functions' characteristics such as continuity and smoothness unlike nonlinear complementarity problem method (NCPM), and LMM can be widely used to solve the equivalent equations with a quadratic convergence rate.
{"title":"Constrained optimization applying decomposed unlimited point method based on KKT condition","authors":"J. H. Zheng, T. Ji, M. S. Li, Q. Wu, P. Wu","doi":"10.1109/CEEC.2013.6659451","DOIUrl":"https://doi.org/10.1109/CEEC.2013.6659451","url":null,"abstract":"Constrained optimization problems play a significant role within optimization problems. In this paper, a novel method, decomposed unlimited point method (DUPM), is proposed to modify the Karush-Kuhn-Tucker (KKT) condition of constrained optimization problems. In the DUPM, KKT condition can be transformed into equations without any limitation in the variable space. Afterwards, the equivalent equations are solved by Levenberg-Marquardt method (LMM), which is the first attempt ever of applying LMM to such situations. Simulation results on various numerical examples demonstrate that DUPM is able to transform the primal KKT condition into equations without changing the functions' characteristics such as continuity and smoothness unlike nonlinear complementarity problem method (NCPM), and LMM can be widely used to solve the equivalent equations with a quadratic convergence rate.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128287160","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
扫码关注我们
求助内容：
应助结果提醒方式：