Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2468-2473
Liang Yuan, Chuan Cai
Uniformly divide the whole ZigBee Network into corresponding equal parts. Select cluster head node according to residual energy and location information of nodes and do relevant rotation on clusters as needed. Do simulation comparisons among classical clustering algorithm LEACH, AODV Algorithm of the existing ZigBee Routing Protocol and this clustering routing algorithm. Simulation results show that this algorithm keeps high effect on the balance of energy consumption in network. The main objective of energy delay design is to reduce energy consumption of nodes, decrease packet loss probability of data transmission in network, increase life cycle of network and balance load of nodes in network.
{"title":"An Improved Clustering Routing Algorithm in Wireless Sensor Network Based on ZigBee","authors":"Liang Yuan, Chuan Cai","doi":"10.4304/jnw.9.9.2468-2473","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2468-2473","url":null,"abstract":"Uniformly divide the whole ZigBee Network into corresponding equal parts. Select cluster head node according to residual energy and location information of nodes and do relevant rotation on clusters as needed. Do simulation comparisons among classical clustering algorithm LEACH, AODV Algorithm of the existing ZigBee Routing Protocol and this clustering routing algorithm. Simulation results show that this algorithm keeps high effect on the balance of energy consumption in network. The main objective of energy delay design is to reduce energy consumption of nodes, decrease packet loss probability of data transmission in network, increase life cycle of network and balance load of nodes in network.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"10 1","pages":"2468-2473"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87323192","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-04-09DOI: 10.4304/jnw.9.9.2514-2520
Xiaohui Su, Tongxin Hu
The key point of flue gas spectra analysis is how to separate and calculate the concentration of different kinds of gas, which is from continuous mixed gas absorption spectrum signal. In this paper, a new iteration of the recursive algorithm is put forward on the basis of Lambert-Beer's law. This algorithm, using the superposition of the absorbance, achieves data nonlinear fitting. It takes the advantages of the wavelength optimum and the circular iteration to distinguish the gas mixture of different composition. Experimental results show that this method can calculate a variety of harmful gas concentration immediately, and the accuracy is up to ± 2%. In addition, this algorithm could be used to measure the concentration of many kinds of gases at one time, and it obtains strong anti-jamming capability which is suitable for practical application of engineering.
{"title":"Flue Gas Analysis Based on Recursive Iteration Algorithm","authors":"Xiaohui Su, Tongxin Hu","doi":"10.4304/jnw.9.9.2514-2520","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2514-2520","url":null,"abstract":"The key point of flue gas spectra analysis is how to separate and calculate the concentration of different kinds of gas, which is from continuous mixed gas absorption spectrum signal. In this paper, a new iteration of the recursive algorithm is put forward on the basis of Lambert-Beer's law. This algorithm, using the superposition of the absorbance, achieves data nonlinear fitting. It takes the advantages of the wavelength optimum and the circular iteration to distinguish the gas mixture of different composition. Experimental results show that this method can calculate a variety of harmful gas concentration immediately, and the accuracy is up to ± 2%. In addition, this algorithm could be used to measure the concentration of many kinds of gases at one time, and it obtains strong anti-jamming capability which is suitable for practical application of engineering.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"78 1","pages":"2514-2520"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90973962","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-04-09DOI: 10.4304/jnw.9.9.2549-2555
Linqin Cai, You Zhang, Jianrong Zhang, Binbin Liu
To controller design and stability analysis for nonlinear Networked Control Systems (NCSs) with time-varying delay, based on the Takagi–Sugeno (T-S) fuzzy model, a controller design scheme was proposed to achieve desired control performance for nonlinear NCSs via state feedback. According to the Lyapunov method, the sufficient condition for the existence of the control law was presented. Simulation results show the proposed methods are effective to make the closed-loop system asymptotically stable for all admissible time delay and can further guarantee the expected performance index for nonlinear NCSs with time-varying delay
{"title":"Controller Design for Nonlinear Networked Control Systems with Time-varying Delay Based on T-S Fuzzy Model","authors":"Linqin Cai, You Zhang, Jianrong Zhang, Binbin Liu","doi":"10.4304/jnw.9.9.2549-2555","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2549-2555","url":null,"abstract":"To controller design and stability analysis for nonlinear Networked Control Systems (NCSs) with time-varying delay, based on the Takagi–Sugeno (T-S) fuzzy model, a controller design scheme was proposed to achieve desired control performance for nonlinear NCSs via state feedback. According to the Lyapunov method, the sufficient condition for the existence of the control law was presented. Simulation results show the proposed methods are effective to make the closed-loop system asymptotically stable for all admissible time delay and can further guarantee the expected performance index for nonlinear NCSs with time-varying delay","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"17 1","pages":"2549-2555"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90977627","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-04-09DOI: 10.4304/jnw.9.9.2498-2503
Xingguang Liu, Zi John
In view of the low efficiency and poor coding performance, an active mechanism network coding algorithm based on multi-channel sensing is proposed. The algorithm first establishes a system model to analyze the work pattern of network coding, then selects the minimum sample as cost function and adopts the multi-channel sensing to examine the coding effect of relay node, which makes the network to learn from the coding effect of relay node so as to send the source information to the relay node with better encoding effect. In order to reduce encoding error rate, active mechanism is adopted to improve the capability of network decoding, where the mechanism uses the transmit power of source node and the size of source information to control terminal decoding error rate. The experiment and simulation results show that our proposed network coding algorithm has a very good effect on encoding and decoding processes and can effectively reduce the network overhead
{"title":"Active Mechanism Network Coding Algorithm based on Multi-channel Sensing","authors":"Xingguang Liu, Zi John","doi":"10.4304/jnw.9.9.2498-2503","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2498-2503","url":null,"abstract":"In view of the low efficiency and poor coding performance, an active mechanism network coding algorithm based on multi-channel sensing is proposed. The algorithm first establishes a system model to analyze the work pattern of network coding, then selects the minimum sample as cost function and adopts the multi-channel sensing to examine the coding effect of relay node, which makes the network to learn from the coding effect of relay node so as to send the source information to the relay node with better encoding effect. In order to reduce encoding error rate, active mechanism is adopted to improve the capability of network decoding, where the mechanism uses the transmit power of source node and the size of source information to control terminal decoding error rate. The experiment and simulation results show that our proposed network coding algorithm has a very good effect on encoding and decoding processes and can effectively reduce the network overhead","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"59 1","pages":"2498-2503"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84243426","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-04-09DOI: 10.4304/jnw.9.9.2504-2513
P. Ni, Y. L. Liu, Z. H. He
The estimation for burnout point parameters of ballistic missile has not been solved systematically. Under the condition without prior information, the paper starts from the change of motion rules caused by the changes of force before and after burnout, and uses the combination of track time cross-extrapolation and the closest distance search to estimate burnout point parameters of target. results show that the closest distance search method is evidently better than the ordinary methods.
{"title":"A New Estimation Method for Burnout Point Parameters of Ballistic Missile Based on Closest Distance Method","authors":"P. Ni, Y. L. Liu, Z. H. He","doi":"10.4304/jnw.9.9.2504-2513","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2504-2513","url":null,"abstract":"The estimation for burnout point parameters of ballistic missile has not been solved systematically. Under the condition without prior information, the paper starts from the change of motion rules caused by the changes of force before and after burnout, and uses the combination of track time cross-extrapolation and the closest distance search to estimate burnout point parameters of target. results show that the closest distance search method is evidently better than the ordinary methods.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"75 1","pages":"2504-2513"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80921845","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-04-09DOI: 10.4304/jnw.9.9.2376-2383
Na Wang, Xiaogang Qi, Lini Duan, Hua Jiang, Xiaofei Liu
Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to solve this kind of problem. In the CRA, sink node moves in a circle around the regional center and the circular area near this trajectory is set as buffer area, in which nodes are connected as backbone datalink. Data is transmitted to the annular buffer area and then reach the sink through the backbone datalink. This paper figures out the optimal location and size of the buffer area in order to minimize the average load of the nodes in the area. Furthermore, this paper proposes CRA-1, which improves the original algorithm by density controlling, for the purpose of balancing the energy consumption of the whole network
{"title":"Clustering-based Routing Algorithm in Wireless Sensor Networks with Mobile Sink","authors":"Na Wang, Xiaogang Qi, Lini Duan, Hua Jiang, Xiaofei Liu","doi":"10.4304/jnw.9.9.2376-2383","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2376-2383","url":null,"abstract":"Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to solve this kind of problem. In the CRA, sink node moves in a circle around the regional center and the circular area near this trajectory is set as buffer area, in which nodes are connected as backbone datalink. Data is transmitted to the annular buffer area and then reach the sink through the backbone datalink. This paper figures out the optimal location and size of the buffer area in order to minimize the average load of the nodes in the area. Furthermore, this paper proposes CRA-1, which improves the original algorithm by density controlling, for the purpose of balancing the energy consumption of the whole network","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"60 1","pages":"2376-2383"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80936398","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-04-09DOI: 10.4304/jnw.9.9.2433-2440
Jincheng Huang, Huihui Xiang, Yaheng Zhang
In Mobile Ad Hoc Network (MANET), due to the mobility of the nodes it is difficult to find the route which can maintain the whole process of data transmission. Therefore, it is very critical to balance, maintain and repair the route within the mobility of nodes and the limited battery energy. Currently there are many protocols from different aspects to solve this problem. This paper proposes a new improved routing protocol, which is based on delayed replay program, and its main objective is to create the stable routing protocol based on hop AODV, node mobility speed and node communication state. The discovery process of improved routing protocols only let the low-speed node forwards the RREQ package, and re-routing request packet delay broadcast according to node’s degree of busy. NS2 simulator is adopted to assess the performance of using the program. Simulation results show that the proposed method has better performance than conventional methods, which mainly shows in better performance on the aspects on packet transmission rate of improved protocol, control overhead and end to end delay
{"title":"Stable AODV Routing Protocol with Energy-aware in Mobile Ad Hoc Network","authors":"Jincheng Huang, Huihui Xiang, Yaheng Zhang","doi":"10.4304/jnw.9.9.2433-2440","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2433-2440","url":null,"abstract":"In Mobile Ad Hoc Network (MANET), due to the mobility of the nodes it is difficult to find the route which can maintain the whole process of data transmission. Therefore, it is very critical to balance, maintain and repair the route within the mobility of nodes and the limited battery energy. Currently there are many protocols from different aspects to solve this problem. This paper proposes a new improved routing protocol, which is based on delayed replay program, and its main objective is to create the stable routing protocol based on hop AODV, node mobility speed and node communication state. The discovery process of improved routing protocols only let the low-speed node forwards the RREQ package, and re-routing request packet delay broadcast according to node’s degree of busy. NS2 simulator is adopted to assess the performance of using the program. Simulation results show that the proposed method has better performance than conventional methods, which mainly shows in better performance on the aspects on packet transmission rate of improved protocol, control overhead and end to end delay","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"30 1","pages":"2433-2440"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85496390","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-04-09DOI: 10.4304/jnw.9.9.2328-2335
Weiting Gao, Hui Li
In the parallel signal processing, the multi-user detection precision of parallel interference cancellation (PIC) detector is always easily affected by the decision error diffusion. Based on the fast convergence and low complexity of blind adaptive Kalman algorithm, a new blind adaptive Kalman-PIC (KPIC) multi-user detection (MUD) algorithm is proposed for the direct sequence spread spectrum code division multiple access (DS-CDMA) system network with strong multiple access interference (MAI). Compared with traditional standard Kalman filter and PIC algorithm, the proposed combined program can totally track the time-varying channel, effectively estimate unknown noise statistics characteristics on-line while conducting state filtering, possibly minimize the detection error diffusion in the interference cancellation processing of single PIC algorithm, thus effectively suppress MAI. Simulation results show that the KPIC algorithm is of better convergence, dynamic tracking ability and precision
{"title":"A Blind Adaptive Kalman-PIC MUD Algorithm for the Multiple Access Communication Network","authors":"Weiting Gao, Hui Li","doi":"10.4304/jnw.9.9.2328-2335","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2328-2335","url":null,"abstract":"In the parallel signal processing, the multi-user detection precision of parallel interference cancellation (PIC) detector is always easily affected by the decision error diffusion. Based on the fast convergence and low complexity of blind adaptive Kalman algorithm, a new blind adaptive Kalman-PIC (KPIC) multi-user detection (MUD) algorithm is proposed for the direct sequence spread spectrum code division multiple access (DS-CDMA) system network with strong multiple access interference (MAI). Compared with traditional standard Kalman filter and PIC algorithm, the proposed combined program can totally track the time-varying channel, effectively estimate unknown noise statistics characteristics on-line while conducting state filtering, possibly minimize the detection error diffusion in the interference cancellation processing of single PIC algorithm, thus effectively suppress MAI. Simulation results show that the KPIC algorithm is of better convergence, dynamic tracking ability and precision","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"44 1","pages":"2328-2335"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89310081","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-04-09DOI: 10.4304/jnw.9.9.2417-2423
Wei Wang, Wei Wei, Jielin Hu, Junting Ye, Q. Zheng
Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching a weight to each first-order formula. The framework is composed principally of structure learning, artificial add or delete formulas, weight learning and inferring. According to the semantic analysis of KUs and their relations, ground predicate set is first extracted. Next, the ground predicate set is inputted into structure learning module to achieve weight formula set. Then, in order to overcome limitations of structure learning, the weight rule set is added or deleted by human. The new weight formula set is turned into weight learning module to acquire the last weight formula set. Finally, knowledge unit relations are recognized by inferring module with the last weight formula set. Experiments on the four data sets related to computer domain show the utility of this approach. The time complexity of structure learning is also analyzed
知识单元(Knowledge unit, KU)是给定领域中最小的完整知识对象。知识单位关系识别是发现知识单位之间的隐含关系，是信息抽取中的关键问题。本文提出了一种基于马尔可夫逻辑网络的知识单元关系识别框架，该框架将概率图模型与一阶逻辑相结合，为每个一阶公式赋予权重。该框架主要由结构学习、人工增删公式、权重学习和推理组成。在对库及其关系进行语义分析的基础上，首先提取基谓词集。然后将基础谓词集输入到结构学习模块中，得到权重公式集。然后，为了克服结构学习的局限性，对权重规则集进行人工添加或删除。将新的权重公式集转化为权重学习模块，得到最后的权重公式集。最后，利用最后的权重公式集，通过推理模块对知识单元关系进行识别。在计算机领域相关的四个数据集上的实验表明了该方法的有效性。分析了结构学习的时间复杂度
{"title":"Knowledge Unit Relation Recognition Based on Markov Logic Networks","authors":"Wei Wang, Wei Wei, Jielin Hu, Junting Ye, Q. Zheng","doi":"10.4304/jnw.9.9.2417-2423","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2417-2423","url":null,"abstract":"Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching a weight to each first-order formula. The framework is composed principally of structure learning, artificial add or delete formulas, weight learning and inferring. According to the semantic analysis of KUs and their relations, ground predicate set is first extracted. Next, the ground predicate set is inputted into structure learning module to achieve weight formula set. Then, in order to overcome limitations of structure learning, the weight rule set is added or deleted by human. The new weight formula set is turned into weight learning module to acquire the last weight formula set. Finally, knowledge unit relations are recognized by inferring module with the last weight formula set. Experiments on the four data sets related to computer domain show the utility of this approach. The time complexity of structure learning is also analyzed","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"68 1","pages":"2417-2423"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90952834","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-04-09DOI: 10.4304/jnw.9.9.2543-2548
Zhi Bai, Yigang He, Sainan Wang
To solve the RFID tag collision problem, a new anti-collision algorithm is proposed by improving the binary tree search algorithm. Through improving the requesting establishment, this algorithm reduces the probability of collision bits and the number of tags requiring collision detection time by using the even number bits for impact identification. The simulation results show that compared with the traditional binary tree search algorithm and dynamic binary tree search algorithm, this algorithm has obvious advantages in terms of the length of the transmission of binary data. In addition, in terms of the average number of requests, the proposed algorithm provides the same performance with the faster identification process, and reduces the time of the transmission of information
{"title":"Research of RFID Tag Anti-collision Algorithm based on Binary Tree","authors":"Zhi Bai, Yigang He, Sainan Wang","doi":"10.4304/jnw.9.9.2543-2548","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2543-2548","url":null,"abstract":"To solve the RFID tag collision problem, a new anti-collision algorithm is proposed by improving the binary tree search algorithm. Through improving the requesting establishment, this algorithm reduces the probability of collision bits and the number of tags requiring collision detection time by using the even number bits for impact identification. The simulation results show that compared with the traditional binary tree search algorithm and dynamic binary tree search algorithm, this algorithm has obvious advantages in terms of the length of the transmission of binary data. In addition, in terms of the average number of requests, the proposed algorithm provides the same performance with the faster identification process, and reduces the time of the transmission of information","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"48 1","pages":"2543-2548"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76596091","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
扫码关注我们
求助内容：
应助结果提醒方式：