Pub Date : 2012-12-06DOI: 10.1109/CEEC.2012.6375403
H. Nguyen, J. Woods, M. Ghanbari
The quality of Side Information determines the performance of the DVC coder. The technique of generating Side Information using only available decoded key frames at decoder offers acceptable result for video sequences with low and medium level of motion. However, for complex and high motion sequences, sending some additional “hint” information from encoder for selective blocks is necessary. This paper proposes a new framework for Distributed Video Coding using selective DC information at the encoder to assist the side information generation at the decoder. This scheme offers higher rate distortion performance for sequences with complex and high motion without adding significant complexity to the encoder.
{"title":"Side information generation in Distributed Video Coding using selective DC coefficients","authors":"H. Nguyen, J. Woods, M. Ghanbari","doi":"10.1109/CEEC.2012.6375403","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375403","url":null,"abstract":"The quality of Side Information determines the performance of the DVC coder. The technique of generating Side Information using only available decoded key frames at decoder offers acceptable result for video sequences with low and medium level of motion. However, for complex and high motion sequences, sending some additional “hint” information from encoder for selective blocks is necessary. This paper proposes a new framework for Distributed Video Coding using selective DC information at the encoder to assist the side information generation at the decoder. This scheme offers higher rate distortion performance for sequences with complex and high motion without adding significant complexity to the encoder.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125693670","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375391
Bowen Lu, Dongbing Gu, Huosheng Hu
This paper presents a sparse history data based method for modelling a latent function with mobile wireless sensor networks. It contains two main tasks, which are estimating the latent function and optimising the sensor deployment. Gaussian process (GP) is selected as the framework according to its excellent regression performance. History data can improve the modelling performance with small amount of sensors in static or slowly changed environment. However, the GP kernel size is expended. On the one hand, in other kernel based (or non-parametric) methods, computation cost increases fast with kernel size. To control the size of GP kernel, informative vector machine (IVM) is introduced for history data selection. On the other hand, centroidal Voronoi tessellation (CVT), a gradient based method, is adopted for optimising sensor deployment. Simulation results with different data selection methods and analyses are given. It's proved that the data selection is effective in reducing computation cost and keeping the precision of the estimated model.
{"title":"Spatial function estimation using Gaussian process with sparse history data in mobile sensor networks","authors":"Bowen Lu, Dongbing Gu, Huosheng Hu","doi":"10.1109/CEEC.2012.6375391","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375391","url":null,"abstract":"This paper presents a sparse history data based method for modelling a latent function with mobile wireless sensor networks. It contains two main tasks, which are estimating the latent function and optimising the sensor deployment. Gaussian process (GP) is selected as the framework according to its excellent regression performance. History data can improve the modelling performance with small amount of sensors in static or slowly changed environment. However, the GP kernel size is expended. On the one hand, in other kernel based (or non-parametric) methods, computation cost increases fast with kernel size. To control the size of GP kernel, informative vector machine (IVM) is introduced for history data selection. On the other hand, centroidal Voronoi tessellation (CVT), a gradient based method, is adopted for optimising sensor deployment. Simulation results with different data selection methods and analyses are given. It's proved that the data selection is effective in reducing computation cost and keeping the precision of the estimated model.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122201051","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375380
M. Al-Asfoor, M. Fasli
Resource sharing in a networked environment has been an evolved field of research in both industry and academia. In a dynamic, resource constrained environment, resource discovery plays a vital role in the resource sharing process. A distributed multi agent model for a dynamic, heterogeneous network has been proposed in this paper. Furthermore, three resource search algorithms have been investigated, namely: Random Walk, Directed Search and Directed Search with Self-Organisation. An approximate matching mechanism between resources and tasks descriptions has been proposed as a solution for the trade-off problem between the accuracy and speed. As performing random search might lead to traverse the whole network and increase the failing ratio, we have introduced a heuristic directed search to overcome this problem. Based on the agents' closeness, the Agents re-organise themselves by creating an overlay network of agents which are holding semantically close resources and then direct the search message accordingly. The proposed solution has been implemented in a simulated environment and simulation results have shown a significant improvement in the search time (calculated as a number of hops).
{"title":"A study of multi agent based resource search algorithms","authors":"M. Al-Asfoor, M. Fasli","doi":"10.1109/CEEC.2012.6375380","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375380","url":null,"abstract":"Resource sharing in a networked environment has been an evolved field of research in both industry and academia. In a dynamic, resource constrained environment, resource discovery plays a vital role in the resource sharing process. A distributed multi agent model for a dynamic, heterogeneous network has been proposed in this paper. Furthermore, three resource search algorithms have been investigated, namely: Random Walk, Directed Search and Directed Search with Self-Organisation. An approximate matching mechanism between resources and tasks descriptions has been proposed as a solution for the trade-off problem between the accuracy and speed. As performing random search might lead to traverse the whole network and increase the failing ratio, we have introduced a heuristic directed search to overcome this problem. Based on the agents' closeness, the Agents re-organise themselves by creating an overlay network of agents which are holding semantically close resources and then direct the search message accordingly. The proposed solution has been implemented in a simulated environment and simulation results have shown a significant improvement in the search time (calculated as a number of hops).","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124599960","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375397
J. Asensio-Cubero, John Q. Gan, Ramaswamy Palaniappan
Brain computer interfacing (BCI) offers the possibility to interact with machines uniquely relying on the user's thoughts. Although wavelet analysis has been used in the BCI field there is evidence that standard wavelet families, such as Daubechies, may not be the optimal approach. In this study, we developed a novel wavelet lifting scheme, specifically for BCI design. The lifting transform in this new approach is based on common spatial patterns (CSP), which allows to exploit the signal characteristics in temporal, spectral and spatial domains simultaneously. Experimental results show that in BCI applications the new wavelet outperforms several first generation wavelet families in terms of classification accuracy and resource consumption.
{"title":"Extracting common spatial patterns based on wavelet lifting for brain computer interface design","authors":"J. Asensio-Cubero, John Q. Gan, Ramaswamy Palaniappan","doi":"10.1109/CEEC.2012.6375397","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375397","url":null,"abstract":"Brain computer interfacing (BCI) offers the possibility to interact with machines uniquely relying on the user's thoughts. Although wavelet analysis has been used in the BCI field there is evidence that standard wavelet families, such as Daubechies, may not be the optimal approach. In this study, we developed a novel wavelet lifting scheme, specifically for BCI design. The lifting transform in this new approach is based on common spatial patterns (CSP), which allows to exploit the signal characteristics in temporal, spectral and spatial domains simultaneously. Experimental results show that in BCI applications the new wavelet outperforms several first generation wavelet families in terms of classification accuracy and resource consumption.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132411540","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375388
E. Bostanci, N. Kanwal, A. Clark
An algorithm for finding planar features from a 3D point cloud by Kinect's depth sensor is described in this paper. The algorithm uses the explicit definition of a plane which allows storing only four parameters per plane rather than storing thousands of points. Extraction of multiple planes from the same set of points is prevented using a rejection mechanism. Parallelism is used for an average speed-up of 2.3:1. Details of the algorithm and results are given along with a discussion of how the calibration of the sensor affects the projections.
{"title":"Extracting planar features from Kinect sensor","authors":"E. Bostanci, N. Kanwal, A. Clark","doi":"10.1109/CEEC.2012.6375388","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375388","url":null,"abstract":"An algorithm for finding planar features from a 3D point cloud by Kinect's depth sensor is described in this paper. The algorithm uses the explicit definition of a plane which allows storing only four parameters per plane rather than storing thousands of points. Extraction of multiple planes from the same set of points is prevented using a rejection mechanism. Parallelism is used for an average speed-up of 2.3:1. Details of the algorithm and results are given along with a discussion of how the calibration of the sensor affects the projections.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132201277","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375382
S. Abdullah, D. Hunter
When designing distributed applications for a Service Oriented Architecture (SOA), the method chosen for service implementation is crucial. This paper determines a rule for choosing the best implementation method through performance comparison of two important communication implementation paradigms - blocking (“synchronous”) and non-blocking (“asynchronous brokered communication”). The service, service requester, service provider, and broker (in the non-blocking case) are evaluated by simulation. Conditions for equal performance are determined, which are expressed in terms of average normalised work, generalising previous work by yielding a rule for choosing the optimal SOA implementation for any given system parameters. We also investigate the stability of this rule with respect to changes in the way the system components are probabilistically modelled.
{"title":"Performance comparison of communication models for Service Oriented Architectures","authors":"S. Abdullah, D. Hunter","doi":"10.1109/CEEC.2012.6375382","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375382","url":null,"abstract":"When designing distributed applications for a Service Oriented Architecture (SOA), the method chosen for service implementation is crucial. This paper determines a rule for choosing the best implementation method through performance comparison of two important communication implementation paradigms - blocking (“synchronous”) and non-blocking (“asynchronous brokered communication”). The service, service requester, service provider, and broker (in the non-blocking case) are evaluated by simulation. Conditions for equal performance are determined, which are expressed in terms of average normalised work, generalising previous work by yielding a rule for choosing the optimal SOA implementation for any given system parameters. We also investigate the stability of this rule with respect to changes in the way the system components are probabilistically modelled.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124729598","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375386
B. Alzahrani, M. Reed, V. Vassilakis
Secure in-packet Bloom filters is an approach used to securely forward source routing packets with small forwarding tables making the forwarding fabric resistant to unauthorized traffic. This resistance can be achieved by dynamically computing the link identifiers on the base of the packet content such as path in-out interfaces and keys of forwarding nodes using a cryptographic function. In this paper we extend a recent work to secure the data plane (i.e. forwarding layer) in Information-Centric Networks (ICN) for long lived flows and analyze the scalability of the Topology Manager function in terms of z-Filters creation and the number of required z-Filter updates.
{"title":"Enabling z-Filter updates for self-routing denial-of-service resistant capabilities","authors":"B. Alzahrani, M. Reed, V. Vassilakis","doi":"10.1109/CEEC.2012.6375386","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375386","url":null,"abstract":"Secure in-packet Bloom filters is an approach used to securely forward source routing packets with small forwarding tables making the forwarding fabric resistant to unauthorized traffic. This resistance can be achieved by dynamically computing the link identifiers on the base of the packet content such as path in-out interfaces and keys of forwarding nodes using a cryptographic function. In this paper we extend a recent work to secure the data plane (i.e. forwarding layer) in Information-Centric Networks (ICN) for long lived flows and analyze the scalability of the Topology Manager function in terms of z-Filters creation and the number of required z-Filter updates.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133585478","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375383
M. Alhomidi, M. Reed
Attack graphs have been widely used to represent and analyze security attacks. More specifically, they show all ways of how an attacker violets a security policy. Most attack graphs are constructed from nodes (vertices) and edges (arcs). Since there are so many research papers, each has a different representation of attack graphs. This paper discuses attack graph representations in terms of its nodes and edges interpretations. Other factors are addressed such the attack graph constructions and scalability.
{"title":"Attack graphs representations","authors":"M. Alhomidi, M. Reed","doi":"10.1109/CEEC.2012.6375383","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375383","url":null,"abstract":"Attack graphs have been widely used to represent and analyze security attacks. More specifically, they show all ways of how an attacker violets a security policy. Most attack graphs are constructed from nodes (vertices) and edges (arcs). Since there are so many research papers, each has a different representation of attack graphs. This paper discuses attack graph representations in terms of its nodes and edges interpretations. Other factors are addressed such the attack graph constructions and scalability.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129090866","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375398
I. Mobin, R. Mondragón, M. M. Khan
In this paper transmission signal power is optimized to increase the energy efficiency of Wireless Local Area Network (WLAN) Voice over IP (VoIP) application. We investigate how to optimize the transmission power without degrading the VoIP Quality of Service (QoS). A Transmission Power Optimization (TPO) algorithm is presented to adopt lowest possible transmission power that does not interrupt the VoIP service quality and increases energy efficiency as well. Extensive analysis is done in Network Simulator-2 (NS-2) [1] to estimate the optimal transmission power for various channel condition. According to our simulation results and analysis it is observed that the optimal transmission power increases the energy efficiency and improves the VoIP performance significantly.
{"title":"Energy efficient transmission power estimation for WLAN VoIP","authors":"I. Mobin, R. Mondragón, M. M. Khan","doi":"10.1109/CEEC.2012.6375398","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375398","url":null,"abstract":"In this paper transmission signal power is optimized to increase the energy efficiency of Wireless Local Area Network (WLAN) Voice over IP (VoIP) application. We investigate how to optimize the transmission power without degrading the VoIP Quality of Service (QoS). A Transmission Power Optimization (TPO) algorithm is presented to adopt lowest possible transmission power that does not interrupt the VoIP service quality and increases energy efficiency as well. Extensive analysis is done in Network Simulator-2 (NS-2) [1] to estimate the optimal transmission power for various channel condition. According to our simulation results and analysis it is observed that the optimal transmission power increases the energy efficiency and improves the VoIP performance significantly.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887588","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 : 2012-12-06DOI: 10.1109/CEEC.2012.6375372
J. Arpasi, S. Bortolin
Group Codes are a generalization of the well known Binary Convolutional Codes. For this reason Group Codes are also called Generalized Convolutional Codes. A classical binary convolutional encoder with rate k/n <; 1 and m memory registers can be described as a Finite State Machine (FSM) in terms of the binary groups Zk2, Zn2 and Zm2, and adequate next-state and encoder homomorphisms defined over the direct product Zk2⊕Zm2. Then the binary convolutional code is the family of bi-infinite sequences produced by the binary convolutional encoder. Since the direct product of groups U ⊕ S can be generalized as an extension U ⊗ S, then the encoder of a group code is a FSM M = (U, S, Y, ν, ω) where U is the inputs group, S is the states group, Y is the outputs group. The next-state homomorphism ν and the encoder homomorphism ω are defined over U ⊗ S. The elements of the group code produced by the FSM are bi-infinite sequences y = {yk}kϵZ with yk ϵ Y. Then, each y can be interpreted as a trajectory of a Dynamical System, hence a group code is a Dynamical System. Therefore a group code will be controllable when it is controllable as a Dynamical System. In this work we present some necessary conditions for the control of group codes produced by FSMs defined on generic abelian extensions U ⊗ S with Zp = {0, 1, ..., p - 1}, the cyclic group of order p.
群码是众所周知的二进制卷积码的一种推广。因此，群码也被称为广义卷积码。具有速率k/n k2, Zn2和Zm2的经典二进制卷积编码器，并且在Zk2⊕Zm2上定义了足够的下一态和编码器同态。那么二进制卷积码就是由二进制卷积编码器产生的双无穷数列族。由于群的直接积U⊕S可以推广为扩展U⊗S，则群码的编码器是一个FSM M = (U, S, Y， ν， ω)，其中U为输入群，S为状态群，Y为输出群。在U⊗s上定义了下一态同态ν和编码器同态ω， FSM产生的群码的元素是双无穷序列y = {yk}kϵZ，其中有yk λ y，则每个y都可以解释为一个动力系统的轨迹，因此群码就是一个动力系统。因此，当一组代码作为一个动力系统是可控的时候，它就是可控的。本文给出了控制一般阿贝尔扩展U⊗S上定义的fsm产生的群码的必要条件，其中Zp ={0,1，…， p - 1}， p阶的环群。
{"title":"On the control of generic abelian group codes","authors":"J. Arpasi, S. Bortolin","doi":"10.1109/CEEC.2012.6375372","DOIUrl":"https://doi.org/10.1109/CEEC.2012.6375372","url":null,"abstract":"Group Codes are a generalization of the well known Binary Convolutional Codes. For this reason Group Codes are also called Generalized Convolutional Codes. A classical binary convolutional encoder with rate k/n <; 1 and m memory registers can be described as a Finite State Machine (FSM) in terms of the binary groups Z<sup>k</sup><sub>2</sub>, Z<sup>n</sup><sub>2</sub> and Z<sup>m</sup><sub>2</sub>, and adequate next-state and encoder homomorphisms defined over the direct product Z<sup>k</sup><sub>2</sub>⊕Z<sup>m</sup><sub>2</sub>. Then the binary convolutional code is the family of bi-infinite sequences produced by the binary convolutional encoder. Since the direct product of groups U ⊕ S can be generalized as an extension U ⊗ S, then the encoder of a group code is a FSM M = (U, S, Y, ν, ω) where U is the inputs group, S is the states group, Y is the outputs group. The next-state homomorphism ν and the encoder homomorphism ω are defined over U ⊗ S. The elements of the group code produced by the FSM are bi-infinite sequences y = {yk}kϵZ with yk ϵ Y. Then, each y can be interpreted as a trajectory of a Dynamical System, hence a group code is a Dynamical System. Therefore a group code will be controllable when it is controllable as a Dynamical System. In this work we present some necessary conditions for the control of group codes produced by FSMs defined on generic abelian extensions U ⊗ S with Z<sub>p</sub> = {0, 1, ..., p - 1}, the cyclic group of order p.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"73 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114251466","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
扫码关注我们
求助内容：
应助结果提醒方式：