Pub Date : 2014-06-27DOI: 10.1109/ICSESS.2014.6933535
Liu Biao, Huamin Feng, Zhang Kejun, Li Yang
In the recent years, many hostile websites have been using polymorphic JavaScript in order to conceal its code. The virtual execution is considered to be effective to process and detect such types of JavaScript. However, a challenge often encountered with that approach is the mandatory preparation of very detail-oriented environments that may also require specific user-driven events for the malicious JavaScript to execute properly as it was designed to. This paper proposes a hierarchical clustering algorithm based on tree edit distance to recognize and categorize hostile JavaScript. Firstly, the JavaScript's abstract syntax tree is constructed to be structural analysis. Secondly, the similarity of two JavaScript is calculated by tree-matching algorithm based on tree edit distance. Finally, the hierarchical clustering of malicious JavaScript is determined by predefined threshold. Our promising results confirm the effectiveness of the approach.
{"title":"A new approach of clustering malicious JavaScript","authors":"Liu Biao, Huamin Feng, Zhang Kejun, Li Yang","doi":"10.1109/ICSESS.2014.6933535","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933535","url":null,"abstract":"In the recent years, many hostile websites have been using polymorphic JavaScript in order to conceal its code. The virtual execution is considered to be effective to process and detect such types of JavaScript. However, a challenge often encountered with that approach is the mandatory preparation of very detail-oriented environments that may also require specific user-driven events for the malicious JavaScript to execute properly as it was designed to. This paper proposes a hierarchical clustering algorithm based on tree edit distance to recognize and categorize hostile JavaScript. Firstly, the JavaScript's abstract syntax tree is constructed to be structural analysis. Secondly, the similarity of two JavaScript is calculated by tree-matching algorithm based on tree edit distance. Finally, the hierarchical clustering of malicious JavaScript is determined by predefined threshold. Our promising results confirm the effectiveness of the approach.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"157-160"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82979407","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.6933759
Lichen Zhang
Specifying and modeling Quality of Service (QoS) properties represents a key challenge for cyber physical system development. Quality of Service (QoS) is a general term that specifies system quality and performance, as opposed to system functionality of cyber physical systems. QoS specification is concerned with capturing application level QoS requirements and management policies of cyber physical systems. Architecture Analysis and Design Language (AADL) is a textual and graphic language used to design and analyze the software and hardware architectures of embedded and realtime systems for performance-critical characteristics (e.g., end-to-end latency, schedulability, and reliability), AADL supports the representation of end-to-end flows through the concept of a flow specification This paper proposes an approach to specify and model QoS based on AADL. We present our current effort to apply and extend AADL to specify and model QoS of cyber physical systems, finally, we illustrate QoS specifying and modeling via an example of specifying and modeling Vehicular Ad-hoc NETwork (VANET).
{"title":"Specification and modeling of QoS based on AADL","authors":"Lichen Zhang","doi":"10.1109/ICSESS.2014.6933759","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933759","url":null,"abstract":"Specifying and modeling Quality of Service (QoS) properties represents a key challenge for cyber physical system development. Quality of Service (QoS) is a general term that specifies system quality and performance, as opposed to system functionality of cyber physical systems. QoS specification is concerned with capturing application level QoS requirements and management policies of cyber physical systems. Architecture Analysis and Design Language (AADL) is a textual and graphic language used to design and analyze the software and hardware architectures of embedded and realtime systems for performance-critical characteristics (e.g., end-to-end latency, schedulability, and reliability), AADL supports the representation of end-to-end flows through the concept of a flow specification This paper proposes an approach to specify and model QoS based on AADL. We present our current effort to apply and extend AADL to specify and model QoS of cyber physical systems, finally, we illustrate QoS specifying and modeling via an example of specifying and modeling Vehicular Ad-hoc NETwork (VANET).","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"4 1","pages":"1107-1110"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81579661","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.6933768
Yan-bing Liu, Qi Wu
The security of Internet of Things (IoT) has already become a thorny problem because of opening deployment and limited resources. Thus, as the essential part of intrusion detection anomaly mining gets more and more attention. However, complexity of algorithm is the vital issue due to the specialty of IoT. Meanwhile, traditional methods with Euclidean distance may cause misjudgment at some extent. So this paper proposes a lightweight anomaly mining algorithm which employ Jaccard coefficient firstly as the judging criterion instead of Euclidean distance. The experiment verifies the availability of proposed algorithm.
{"title":"A lightweight anomaly mining algorithm in the Internet of Things","authors":"Yan-bing Liu, Qi Wu","doi":"10.1109/ICSESS.2014.6933768","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933768","url":null,"abstract":"The security of Internet of Things (IoT) has already become a thorny problem because of opening deployment and limited resources. Thus, as the essential part of intrusion detection anomaly mining gets more and more attention. However, complexity of algorithm is the vital issue due to the specialty of IoT. Meanwhile, traditional methods with Euclidean distance may cause misjudgment at some extent. So this paper proposes a lightweight anomaly mining algorithm which employ Jaccard coefficient firstly as the judging criterion instead of Euclidean distance. The experiment verifies the availability of proposed algorithm.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"23 1","pages":"1142-1145"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82828802","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.6933585
Ming Zhu, Yan Wu
In this paper we propose a hybrid deep network for image recognition. First we use the sparse autoencoder(SAE) which is a method to extract high-level feature representations of data in an unsupervised way, without any manual feature engineering, and then we perform the classification using the deep belief networks(DBNs), which consist of restricted Boltzmann machine(RBM). Finally, we implement some comparative experiments on image datasets, and the results show that our methods achieved better performance when compared with neural network and other deep learning techniques such as DBNs.
{"title":"A novel deep model for image recognition","authors":"Ming Zhu, Yan Wu","doi":"10.1109/ICSESS.2014.6933585","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933585","url":null,"abstract":"In this paper we propose a hybrid deep network for image recognition. First we use the sparse autoencoder(SAE) which is a method to extract high-level feature representations of data in an unsupervised way, without any manual feature engineering, and then we perform the classification using the deep belief networks(DBNs), which consist of restricted Boltzmann machine(RBM). Finally, we implement some comparative experiments on image datasets, and the results show that our methods achieved better performance when compared with neural network and other deep learning techniques such as DBNs.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"33 1","pages":"373-376"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82887288","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.6933755
Maheen Islam, M. L. Rahman, M. Mamun-Or-Rashid
Traffic in WMNs has a wide range of variations which contributes to channel saturation and may bring up congestion due to contention caused by concurrent transmission, buffer overflows and time varying wireless channel condition. In this paper, we propose a distributed congestion control scheme for wireless mesh networks to ensure higher network throughput while avoiding congestion and maintaining inter-flow fairness. Our proposed technique handles congestion by restricting the available transmission rate of downstream nodes among the upstream nodes according to their flow demands based on their: packet arrival rate, service rate and buffer occupancy. We also introduce prioritized queues in each node to treat real time and non-real time traffic differently. Therefore, congestion degree calculation, rate allocation and traffic prioritization ensures higher network throughput and guaranteed delivery of real time traffic. Experiments conducted on ns-2 simulations demonstrate that our proposed algorithm can achieve significant improvements in both overall network throughput and inter-flow fairness for both non real time and delay bound traffic.
{"title":"Load adaptive congestion control and rate readjustment for wireless mesh networks","authors":"Maheen Islam, M. L. Rahman, M. Mamun-Or-Rashid","doi":"10.1109/ICSESS.2014.6933755","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933755","url":null,"abstract":"Traffic in WMNs has a wide range of variations which contributes to channel saturation and may bring up congestion due to contention caused by concurrent transmission, buffer overflows and time varying wireless channel condition. In this paper, we propose a distributed congestion control scheme for wireless mesh networks to ensure higher network throughput while avoiding congestion and maintaining inter-flow fairness. Our proposed technique handles congestion by restricting the available transmission rate of downstream nodes among the upstream nodes according to their flow demands based on their: packet arrival rate, service rate and buffer occupancy. We also introduce prioritized queues in each node to treat real time and non-real time traffic differently. Therefore, congestion degree calculation, rate allocation and traffic prioritization ensures higher network throughput and guaranteed delivery of real time traffic. Experiments conducted on ns-2 simulations demonstrate that our proposed algorithm can achieve significant improvements in both overall network throughput and inter-flow fairness for both non real time and delay bound traffic.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"27 1","pages":"1088-1092"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89839044","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.6933694
Jian Zhang, Dan Qu, Zhen Li
Recurrent neural network language models have solved the problems of data sparseness and dimensionality disaster which exist in traditional N-gram models. RNNLMs have recently demonstrated state-of-the-art performance in speech recognition, machine translation and other tasks. In this paper, we improve the model performance by providing contextual word vectors in association with RNNLMs. This method can reinforce the ability of learning long-distance information using vectors training from Skip-gram model. The experimental results show that the proposed method can improve the perplexity performance significantly on Penn Treebank data. And we further apply the models to speech recognition task on the Wall Street Journal corpora, where we achieve obvious improvements in word-error-rate.
{"title":"An improved recurrent neural network language model with context vector features","authors":"Jian Zhang, Dan Qu, Zhen Li","doi":"10.1109/ICSESS.2014.6933694","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933694","url":null,"abstract":"Recurrent neural network language models have solved the problems of data sparseness and dimensionality disaster which exist in traditional N-gram models. RNNLMs have recently demonstrated state-of-the-art performance in speech recognition, machine translation and other tasks. In this paper, we improve the model performance by providing contextual word vectors in association with RNNLMs. This method can reinforce the ability of learning long-distance information using vectors training from Skip-gram model. The experimental results show that the proposed method can improve the perplexity performance significantly on Penn Treebank data. And we further apply the models to speech recognition task on the Wall Street Journal corpora, where we achieve obvious improvements in word-error-rate.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"34 1","pages":"828-831"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89916388","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.6933509
Wenhong Liu, Xin Wu, Weixiang Zhang, Yang Xu
In order to improve the efficiency of software test case execution, this paper analyzed the impact of some factors to test cases prioritization and presented two adjustment algorithms. These factors included software requirement prioritization, software failure severity and software failure probability level. Firstly, gave the definition of software requirement prioritization, the ranking methods of software failure severity and software failure probability level, the description of the relationship between test cases and test requirements. Then, presented an initial test case prioritization method based on the analysis. And then, proposed a dynamic adjustment algorithm using of software requirement prioritization and software failure probability level when software failure occurred. Experimental data show that the two test case prioritization algorithms can improve the efficiency of software testing and are helpful to find more software defects in a short period.
{"title":"The research of the test case prioritization algorithm for black box testing","authors":"Wenhong Liu, Xin Wu, Weixiang Zhang, Yang Xu","doi":"10.1109/ICSESS.2014.6933509","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933509","url":null,"abstract":"In order to improve the efficiency of software test case execution, this paper analyzed the impact of some factors to test cases prioritization and presented two adjustment algorithms. These factors included software requirement prioritization, software failure severity and software failure probability level. Firstly, gave the definition of software requirement prioritization, the ranking methods of software failure severity and software failure probability level, the description of the relationship between test cases and test requirements. Then, presented an initial test case prioritization method based on the analysis. And then, proposed a dynamic adjustment algorithm using of software requirement prioritization and software failure probability level when software failure occurred. Experimental data show that the two test case prioritization algorithms can improve the efficiency of software testing and are helpful to find more software defects in a short period.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"47 1 1","pages":"37-40"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78042139","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.6933529
Muhammad Abdul Basit-Ur-Rahim, F. Arif, J. Ahmad
SysML is a graphical modeling language that is more suitable for modeling of real-time and embedded systems. The application modeled in SysML must be verified in earlier phases of software development life cycle to increase the reliability and reduce the modeling and verification cost. The available tools for verification are sequential and parallel types. The sequential verification tools either fail or unable to show the significant performance to verify a large scale embedded real-time system. The limitations of sequential verification tools have increased the importance of parallel verification tools. While, DiVinE is parallel verification tool that doesn't support the timed verification of model. By keeping in view the limitations of both types of model checkers and their compatibility, we have proposed a methodology to use both types of model checkers for verification of real-time system that are graphically modeled using SysML. We demonstrate the suitability of the framework by applying it on a case study of embedded real-time system. The case study is modeled using state machine diagram of SysML and verified against specified timed properties using UPPAAL while the untimed properties are verified using DiVinE.
{"title":"Modeling of real-time embedded systems using SysML and its verification using UPPAAL and DiVinE","authors":"Muhammad Abdul Basit-Ur-Rahim, F. Arif, J. Ahmad","doi":"10.1109/ICSESS.2014.6933529","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933529","url":null,"abstract":"SysML is a graphical modeling language that is more suitable for modeling of real-time and embedded systems. The application modeled in SysML must be verified in earlier phases of software development life cycle to increase the reliability and reduce the modeling and verification cost. The available tools for verification are sequential and parallel types. The sequential verification tools either fail or unable to show the significant performance to verify a large scale embedded real-time system. The limitations of sequential verification tools have increased the importance of parallel verification tools. While, DiVinE is parallel verification tool that doesn't support the timed verification of model. By keeping in view the limitations of both types of model checkers and their compatibility, we have proposed a methodology to use both types of model checkers for verification of real-time system that are graphically modeled using SysML. We demonstrate the suitability of the framework by applying it on a case study of embedded real-time system. The case study is modeled using state machine diagram of SysML and verified against specified timed properties using UPPAAL while the untimed properties are verified using DiVinE.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"31 1","pages":"132-136"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82312548","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.6933763
Zhenchao Wang, Zhe Li, Xianchao Zhu
ODMA-WiFi network is a sort of multi-hop temporary autonomous network which is of great compatibility, composed of lots of mobile nodes without pre-positioned network infrastructure, and mainly used for conditions where the network needs to be deployed rapidly. This flexibility of ODMA-WiFi nodes introduces new challenges for the design of efficient network protocols. The throughput of the network depends largely on the routing algorithm, and due to the special nature of ODMA, there is a great deal of difference between ODMA-WiFi and traditional technologies. In this paper, the features of ODMA-WiFi networks are firstly presented, then several typical routing protocols are introduced and the performances of each protocol are analyzed and compared. Finally, we come to the conclusion through the above process.
{"title":"Routing algorithms analysis for ODMA-WiFi systems","authors":"Zhenchao Wang, Zhe Li, Xianchao Zhu","doi":"10.1109/ICSESS.2014.6933763","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933763","url":null,"abstract":"ODMA-WiFi network is a sort of multi-hop temporary autonomous network which is of great compatibility, composed of lots of mobile nodes without pre-positioned network infrastructure, and mainly used for conditions where the network needs to be deployed rapidly. This flexibility of ODMA-WiFi nodes introduces new challenges for the design of efficient network protocols. The throughput of the network depends largely on the routing algorithm, and due to the special nature of ODMA, there is a great deal of difference between ODMA-WiFi and traditional technologies. In this paper, the features of ODMA-WiFi networks are firstly presented, then several typical routing protocols are introduced and the performances of each protocol are analyzed and compared. Finally, we come to the conclusion through the above process.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"30 1","pages":"1122-1125"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80635043","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.6933593
Wenbing Zhao
Fault tolerance is a crucial requirement for big data and cloud computing because it helps remove single point of failures. The Paxos algorithm has been employed in a number of real-world fault tolerant systems. Fast Paxos is one of the latest algorithms in the Paxos family of algorithms for distributed consensus. In Fast Paxos, an acceptor is allowed to cast a vote for a value of its own choice unilaterally in a fast round, which eliminates a communication step for reaching consensus. As a tradeoff, a bigger quorum than simple majority must be used and a value selection rule is employed to select the right value for agreement to overcome collisions. The derivation of quorum requirements and value selection rule in the original article on Fast Paxos by Lamport, while very rigorous, may be hard to follow and difficult to implement. In this paper, we present a more intuitive approach to deriving the quorum requirements and easy-to-implement value selection rule for Fast Paxos.
{"title":"On the quorum requirement and value selection rule for Fast Paxos","authors":"Wenbing Zhao","doi":"10.1109/ICSESS.2014.6933593","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933593","url":null,"abstract":"Fault tolerance is a crucial requirement for big data and cloud computing because it helps remove single point of failures. The Paxos algorithm has been employed in a number of real-world fault tolerant systems. Fast Paxos is one of the latest algorithms in the Paxos family of algorithms for distributed consensus. In Fast Paxos, an acceptor is allowed to cast a vote for a value of its own choice unilaterally in a fast round, which eliminates a communication step for reaching consensus. As a tradeoff, a bigger quorum than simple majority must be used and a value selection rule is employed to select the right value for agreement to overcome collisions. The derivation of quorum requirements and value selection rule in the original article on Fast Paxos by Lamport, while very rigorous, may be hard to follow and difficult to implement. In this paper, we present a more intuitive approach to deriving the quorum requirements and easy-to-implement value selection rule for Fast Paxos.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"778 1","pages":"406-409"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76409385","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
扫码关注我们
求助内容：
应助结果提醒方式：