Pub Date : 2007-12-04DOI: 10.1109/ISCIT.2007.4392092
L. Pap, J. Zou
In this paper, a new image enhancement method for DNA microarray images, namely the Conditional Convolution Sub-block Histogram Equalization (CCSHE), is presented. This is accomplished by first, converting the image into a binary image using the histogram transformation function. By doing this, the background and some of the artifacts in the image are separated from the DNA microarray spots. Secondly, this method also applies a conditional convolution filter depending on two input values which control how many times two individual convolution kernels are applied. By performing these operations, the unwanted signals known as artifacts are reduced, providing a more accurate gridding result.
{"title":"Image enhancement for DNA microarray gridding using Conditional Convolution Sub-Block Histogram Equalization","authors":"L. Pap, J. Zou","doi":"10.1109/ISCIT.2007.4392092","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392092","url":null,"abstract":"In this paper, a new image enhancement method for DNA microarray images, namely the Conditional Convolution Sub-block Histogram Equalization (CCSHE), is presented. This is accomplished by first, converting the image into a binary image using the histogram transformation function. By doing this, the background and some of the artifacts in the image are separated from the DNA microarray spots. Secondly, this method also applies a conditional convolution filter depending on two input values which control how many times two individual convolution kernels are applied. By performing these operations, the unwanted signals known as artifacts are reduced, providing a more accurate gridding result.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"9 46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827729","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4391990
Gang Yang, Yunfeng Zhou, Shixiang Qian
OFDM (Orthogonal frequency division multiplexing) is one of the key techniques for 4th generation high data rate communications system. However OFDM suffers from high peak-to-average power ratio (PAPR) which substantially degrades the efficiency of a linear power amplifier. A new nonlinear companding transform using hyperbolic tangent sigmoid transfer function is proposed for PAPR reduction in this paper. The proposed method expands the small signals and compresses the peak signals in the time domain simultaneously without changing the average power. Computer simulation based on MATLAB shows that the proposed method gains more peak reduction and improves the BER (bit error ratio) performance slightly, compared with the Huang companding method.
{"title":"Using hyperbolic tangent sigmoid transfer function for companding transform in OFDM system","authors":"Gang Yang, Yunfeng Zhou, Shixiang Qian","doi":"10.1109/ISCIT.2007.4391990","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4391990","url":null,"abstract":"OFDM (Orthogonal frequency division multiplexing) is one of the key techniques for 4th generation high data rate communications system. However OFDM suffers from high peak-to-average power ratio (PAPR) which substantially degrades the efficiency of a linear power amplifier. A new nonlinear companding transform using hyperbolic tangent sigmoid transfer function is proposed for PAPR reduction in this paper. The proposed method expands the small signals and compresses the peak signals in the time domain simultaneously without changing the average power. Computer simulation based on MATLAB shows that the proposed method gains more peak reduction and improves the BER (bit error ratio) performance slightly, compared with the Huang companding method.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126422853","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392006
Jeng-Kuang Hwang, Kuei-Horng Lin, Jeng-Da Li, Juinn-Horng Deng
A baseband multipath fading channel emulator is implemented on Xilinx XtremeDSP FPGA platform through high-level design. Without any RTL coding, fast prototyping of important modules can be done in the form of high-level Simulink models and Xilinx System Generator IP blocks. These modules include the white Gaussian noise generator (WGNG), Doppler filter, direct digital frequency synthesizer (DDFS), multi-rate interpolators, and multipath signal generator. Since all modules are designed in high level, the system parameters and configuration can be easily changed as desired. The FPGA emulator have been tested at a sampling rate of 30 Msps, and all the measured signals are well coincides with the simulation results, thus verifying the correctness of the design.
通过高层设计，在Xilinx XtremeDSP FPGA平台上实现了一个基带多径衰落信道仿真器。无需任何RTL编码，重要模块的快速原型可以以高级Simulink模型和Xilinx System Generator IP块的形式完成。这些模块包括高斯白噪声发生器(WGNG)，多普勒滤波器，直接数字频率合成器(DDFS)，多速率插值器和多径信号发生器。由于所有模块都是高层次设计，系统参数和配置可以很容易地根据需要进行更改。FPGA仿真器在30 Msps的采样率下进行了测试，所有测量信号与仿真结果吻合良好，从而验证了设计的正确性。
{"title":"Fast FPGA prototyping of a multipath fading channel emulator via high-level design","authors":"Jeng-Kuang Hwang, Kuei-Horng Lin, Jeng-Da Li, Juinn-Horng Deng","doi":"10.1109/ISCIT.2007.4392006","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392006","url":null,"abstract":"A baseband multipath fading channel emulator is implemented on Xilinx XtremeDSP FPGA platform through high-level design. Without any RTL coding, fast prototyping of important modules can be done in the form of high-level Simulink models and Xilinx System Generator IP blocks. These modules include the white Gaussian noise generator (WGNG), Doppler filter, direct digital frequency synthesizer (DDFS), multi-rate interpolators, and multipath signal generator. Since all modules are designed in high level, the system parameters and configuration can be easily changed as desired. The FPGA emulator have been tested at a sampling rate of 30 Msps, and all the measured signals are well coincides with the simulation results, thus verifying the correctness of the design.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428001","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392200
A. Voicila, F. Verdier, D. Declercq, M. Fossorier, P. Urard
In this paper, we propose a hardware implementation of the EMS decoding algorithm for non-binary LDPC codes, presented in [10]. To the knowledge of the authors this is the first implementation of a GF(q) LDPC decoder for high order fields (q ges 64). The originality of the proposed architecture is that it takes into account the memory problem of the non-binary LDPC decoders, together with a significant complexity reduction per decoding iteration which becomes independent from the field order. We present the estimation of the non-binary decoder implementation and key metrics including throughput and hardware complexity. The error decoding performance of the low complexity algorithm with proper compensation has been obtained through computer simulations. The frame error rate results are quite good with respect to the important complexity reduction. The results show also that an implementation of a non-binary LDPC decoder is now feasible and the extra complexity of the decoder is balanced by the superior performance of this class of codes. With their foreseen simple architectures and good-error correcting performances, non-binary LDPC codes provide a promising vehicle for real-life efficient coding system implementations.
{"title":"Architecture of a low-complexity non-binary LDPC decoder for high order fields","authors":"A. Voicila, F. Verdier, D. Declercq, M. Fossorier, P. Urard","doi":"10.1109/ISCIT.2007.4392200","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392200","url":null,"abstract":"In this paper, we propose a hardware implementation of the EMS decoding algorithm for non-binary LDPC codes, presented in [10]. To the knowledge of the authors this is the first implementation of a GF(q) LDPC decoder for high order fields (q ges 64). The originality of the proposed architecture is that it takes into account the memory problem of the non-binary LDPC decoders, together with a significant complexity reduction per decoding iteration which becomes independent from the field order. We present the estimation of the non-binary decoder implementation and key metrics including throughput and hardware complexity. The error decoding performance of the low complexity algorithm with proper compensation has been obtained through computer simulations. The frame error rate results are quite good with respect to the important complexity reduction. The results show also that an implementation of a non-binary LDPC decoder is now feasible and the extra complexity of the decoder is balanced by the superior performance of this class of codes. With their foreseen simple architectures and good-error correcting performances, non-binary LDPC codes provide a promising vehicle for real-life efficient coding system implementations.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124095842","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392004
Jun Pang, Lei Shi, Siliang Hua, Tiejun Zhang, C. Hou
This paper introduces a reconfigurable on-chip debugger (OCD) with a real-time tracer. By setting several parameters, the OCD is readily integrated with diversified microprocessor cores. Moreover, a trace unit is implemented with Lempel-Ziv compression algorithm to trace instruction address of target processor in real-time, to meet the demand of dynamic debugging. The OCD is successfully integrated with one 8 bit microcontroller and one 32 bit processor. The experiments results verify that our design is feasible.
{"title":"Reconfigurable On-Chip Debugger with a real-time tracer","authors":"Jun Pang, Lei Shi, Siliang Hua, Tiejun Zhang, C. Hou","doi":"10.1109/ISCIT.2007.4392004","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392004","url":null,"abstract":"This paper introduces a reconfigurable on-chip debugger (OCD) with a real-time tracer. By setting several parameters, the OCD is readily integrated with diversified microprocessor cores. Moreover, a trace unit is implemented with Lempel-Ziv compression algorithm to trace instruction address of target processor in real-time, to meet the demand of dynamic debugging. The OCD is successfully integrated with one 8 bit microcontroller and one 32 bit processor. The experiments results verify that our design is feasible.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124378339","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392013
B. Jung, T. Ban, Wan Choi, D. Sung
We mathematically analyze the system capacity of one simple feedback scheme and two opportunistic feedback schemes: simple-feedback, max-feedback, and max-n-feedback schemes, in orthogonal frequency division multiple access (OFDMA) systems. The maximum signal-to-noise ratio (SNR) scheduling strategy can be used as a scheduling criterion at base stations (BSs). In the simple-feedback scheme, each user sends the received SNRs of all sub-bands to the BS for frequency domain scheduling (FDS) at the BS. In two opportunistic feedback (OFB) schemes: max-feedback and max-n-feedback schemes, each user sends the reduced number of SNR values among the SNR values of all sub-bands in order to reduce the feedback overhead. In this paper, we derive the system capacity of the simple-feedback and max-feedback schemes in a closed-form. In addition, we derive the upper-bound of the system capacity of the max-n-feedback scheme. The analytical results agree with computer simulation results. Furthermore, the results show that the OFB schemes can reduce the feedback overhead, while the multiuser diversity can be maintained as the number of user increases.
{"title":"Capacity analysis of simple and opportunistic feedback schemes in OFDMA Systems","authors":"B. Jung, T. Ban, Wan Choi, D. Sung","doi":"10.1109/ISCIT.2007.4392013","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392013","url":null,"abstract":"We mathematically analyze the system capacity of one simple feedback scheme and two opportunistic feedback schemes: simple-feedback, max-feedback, and max-n-feedback schemes, in orthogonal frequency division multiple access (OFDMA) systems. The maximum signal-to-noise ratio (SNR) scheduling strategy can be used as a scheduling criterion at base stations (BSs). In the simple-feedback scheme, each user sends the received SNRs of all sub-bands to the BS for frequency domain scheduling (FDS) at the BS. In two opportunistic feedback (OFB) schemes: max-feedback and max-n-feedback schemes, each user sends the reduced number of SNR values among the SNR values of all sub-bands in order to reduce the feedback overhead. In this paper, we derive the system capacity of the simple-feedback and max-feedback schemes in a closed-form. In addition, we derive the upper-bound of the system capacity of the max-n-feedback scheme. The analytical results agree with computer simulation results. Furthermore, the results show that the OFB schemes can reduce the feedback overhead, while the multiuser diversity can be maintained as the number of user increases.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125275629","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4391981
P. Silapan, W. Jaikla, M. Siripruchyanun
This article presents the modified design for a basic current-mode building block for analog signal processing, named as current controlled current differencing buffered amplifier (CCCDBA). Its parasitic resistances at two current input ports can be controlled by an input bias current. The output current and voltage offsets including power consumption are low compared to ordinary CCCDBA description with same implemented technology. The proposed element is realized in a BiCMOS technology and its performance is examined through PSPICE simulations. In addition, an example as a current-mode multiplier/divider is included. It displays usability of the proposed element.
{"title":"High-performance BiCMOS current Controlled CDBA and application","authors":"P. Silapan, W. Jaikla, M. Siripruchyanun","doi":"10.1109/ISCIT.2007.4391981","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4391981","url":null,"abstract":"This article presents the modified design for a basic current-mode building block for analog signal processing, named as current controlled current differencing buffered amplifier (CCCDBA). Its parasitic resistances at two current input ports can be controlled by an input bias current. The output current and voltage offsets including power consumption are low compared to ordinary CCCDBA description with same implemented technology. The proposed element is realized in a BiCMOS technology and its performance is examined through PSPICE simulations. In addition, an example as a current-mode multiplier/divider is included. It displays usability of the proposed element.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131671535","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392087
D. Romaņa, Y. Musashi, H. Nagatomi, K. Sugitani
We statistically investigated on the unusual big DNS resolution traffic toward the top domain DNS server from a university local campus network in April 11th, 2006. The following results are obtained: (1) In April 11th, the DNS query traffic includes a lot of fully qualified domain names (FQDNs) of several specific Web sites as name resolution keywords. (2) Also, the DNS query traffic includes a plenty of source IP addresses of PC clients. Usually, we can observe the source IP addresses of E-mail and/or Web servers in the usual DNS query traffic, mainly. From this point, it can be concluded that the PC clients are probably infected with bot worms (BWs) and they have tried to crash the top domain DNS server.
{"title":"Statistical study of unusual DNS query traffic","authors":"D. Romaņa, Y. Musashi, H. Nagatomi, K. Sugitani","doi":"10.1109/ISCIT.2007.4392087","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392087","url":null,"abstract":"We statistically investigated on the unusual big DNS resolution traffic toward the top domain DNS server from a university local campus network in April 11th, 2006. The following results are obtained: (1) In April 11th, the DNS query traffic includes a lot of fully qualified domain names (FQDNs) of several specific Web sites as name resolution keywords. (2) Also, the DNS query traffic includes a plenty of source IP addresses of PC clients. Usually, we can observe the source IP addresses of E-mail and/or Web servers in the usual DNS query traffic, mainly. From this point, it can be concluded that the PC clients are probably infected with bot worms (BWs) and they have tried to crash the top domain DNS server.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131765994","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392198
Chen Lianghui, Huang Hanying
In this paper, the problem of joint Bayesian active users' identification and multiuser detection in an uncoded cell DS-CDMA system with unknown colored noise is considered. The number of active users follows the Poisson distribution and the observation vectors are considered as the compound Poisson process vitiated by the colored noise. According to the actual condition of users' calling and being called in cells, it defines five kinds of active users' state parameter space movements. We show the conditional posterior probability density function and the equation of conditional posterior likelihood ratio of multiuser detector by introducing subspace algorithm and Bayesian inference. Two-layer nesting iteration Markov Chain Monte Carlo (MCMC) method of Reversible Jump MCMC (RJMCMC) and Gibbs Sampler is used parameters estimation and multiuser detection jointly. Simulation results support the effectiveness of nesting iteration methods.
{"title":"Joint active users’ identification and multiuser detection in cell DS-CDMA system","authors":"Chen Lianghui, Huang Hanying","doi":"10.1109/ISCIT.2007.4392198","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392198","url":null,"abstract":"In this paper, the problem of joint Bayesian active users' identification and multiuser detection in an uncoded cell DS-CDMA system with unknown colored noise is considered. The number of active users follows the Poisson distribution and the observation vectors are considered as the compound Poisson process vitiated by the colored noise. According to the actual condition of users' calling and being called in cells, it defines five kinds of active users' state parameter space movements. We show the conditional posterior probability density function and the equation of conditional posterior likelihood ratio of multiuser detector by introducing subspace algorithm and Bayesian inference. Two-layer nesting iteration Markov Chain Monte Carlo (MCMC) method of Reversible Jump MCMC (RJMCMC) and Gibbs Sampler is used parameters estimation and multiuser detection jointly. Simulation results support the effectiveness of nesting iteration methods.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130471798","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}
Multihop transmissions over wireless mesh networks present limited end-to-end (E2E) data rates, as every hop waits for an entire packet to arrive before starting retransmission. That is, the E2E data rate drops when every hop stores and then forwards packets, thus making such transmissions unsuitable for multimedia applications. In this work, in order to increase data rates, we present an ultra-wideband (UWB) radio transceiver capable of concurrently transmit and receive (cTxRx) packets. However, concurrently receiving and transmitting comes at the cost of a channel model with increased interference level. Herein, we explain a new interference model and propose a transceiver that compensates for it. We describe the transceiver mathematically and analyze its performance via simulations. Also, we demonstrate that the E2E data rate exceeds that of current multihop transmissions, thus allowing multimedia traffic to be transmitted over a multi-hop wireless mesh network.
{"title":"Viability of concurrent transmission and reception for UWB radios over multipath channels","authors":"Ricardo Gandia Sanchez, Xiaojing Huang, Kwan-Wu Chin","doi":"10.1109/ISCIT.2007.4392207","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392207","url":null,"abstract":"Multihop transmissions over wireless mesh networks present limited end-to-end (E2E) data rates, as every hop waits for an entire packet to arrive before starting retransmission. That is, the E2E data rate drops when every hop stores and then forwards packets, thus making such transmissions unsuitable for multimedia applications. In this work, in order to increase data rates, we present an ultra-wideband (UWB) radio transceiver capable of concurrently transmit and receive (cTxRx) packets. However, concurrently receiving and transmitting comes at the cost of a channel model with increased interference level. Herein, we explain a new interference model and propose a transceiver that compensates for it. We describe the transceiver mathematically and analyze its performance via simulations. Also, we demonstrate that the E2E data rate exceeds that of current multihop transmissions, thus allowing multimedia traffic to be transmitted over a multi-hop wireless mesh network.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130485710","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
扫码关注我们
求助内容：
应助结果提醒方式：