Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261572
V. Bohossian, Jehoshua Bruck
The existence of a perfect 1-factorization of the complete graph K n, for arbitrary n, is a 40-year old open problem in graph theory. Two infinite families of perfect 1-factorizations are known for K2p and Kp+1, where p is a prime. It was shown in L. Xu et al. (1999) that finding a perfect 1-factorization of Kn can be reduced to a problem in coding, i.e. to constructing an MDS, lowest density array code of length n. In this paper, a new method for shortening arbitrary array codes is introduced. It is then used to derive the Kp+1 family of perfect 1-factorizations from the K 2p family, by applying the reduction mentioned above. Namely, techniques from coding theory are used to prove a new result in graph theory
对于任意n的完全图K n的完全1分解的存在性，是图论中一个有40年历史的开放问题。两个无限族的完全1因子分解已知为K2p和Kp+1，其中p是素数。L. Xu et al.(1999)表明，寻找Kn的完美1因子分解可以归结为一个编码问题，即构造一个长度为n的最小密度阵列码MDS。本文介绍了一种缩短任意阵列码的新方法。然后用它从k2p族推导出Kp+1族的完全1因子分解，通过应用上面提到的简化。也就是说，利用编码理论中的技术来证明图论中的一个新结果
{"title":"Shortening Array Codes and the Perfect 1-Factorization Conjecture","authors":"V. Bohossian, Jehoshua Bruck","doi":"10.1109/ISIT.2006.261572","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261572","url":null,"abstract":"The existence of a perfect 1-factorization of the complete graph K n, for arbitrary n, is a 40-year old open problem in graph theory. Two infinite families of perfect 1-factorizations are known for K2p and Kp+1, where p is a prime. It was shown in L. Xu et al. (1999) that finding a perfect 1-factorization of Kn can be reduced to a problem in coding, i.e. to constructing an MDS, lowest density array code of length n. In this paper, a new method for shortening arbitrary array codes is introduced. It is then used to derive the Kp+1 family of perfect 1-factorizations from the K 2p family, by applying the reduction mentioned above. Namely, techniques from coding theory are used to prove a new result in graph theory","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72667095","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261605
Jiwoong Jang, Jung-Soo Chung, Jong-Seon No, Habong Chung
In this paper, we propose the new construction methods of constructing optimal low correlation zone (LCZ) sequences. We construct the new p-ary LCZ sequence sets by adopting p-ary sequence of period p m - 1 with ideal autocorrelation for integers n and m such that m n as a column sequence. The new construction methods give us the optimal sets with respect to the bound by Tang, Fan, and Matsufuji
本文提出了构造最优低相关带序列的新方法。采用周期为pm - 1的p- ey序列，对整数n和m具有理想的自相关，使得mn为列序列，构造了新的p- ey LCZ序列集。新的构造方法给出了关于Tang, Fan和Matsufuji的界的最优集
{"title":"New Sets of Optimal p-ary Low Correlation Zone Sequences","authors":"Jiwoong Jang, Jung-Soo Chung, Jong-Seon No, Habong Chung","doi":"10.1109/ISIT.2006.261605","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261605","url":null,"abstract":"In this paper, we propose the new construction methods of constructing optimal low correlation zone (LCZ) sequences. We construct the new p-ary LCZ sequence sets by adopting p-ary sequence of period p m - 1 with ideal autocorrelation for integers n and m such that m n as a column sequence. The new construction methods give us the optimal sets with respect to the bound by Tang, Fan, and Matsufuji","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89122742","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261717
T. Halford, K. Chugg, A. Grant
Let C be an [n, k, d] binary linear code with rate R = k/n and dual Cperp. In this correspondence, it is shown that C can be represented by a 4-cycle-free Tanner graph only if: pdperp les lfloorradicnp(p-1)+n2/4+n/2rfloor where p = n - k and dperp is the minimum distance of Cperp . By applying this result, it is shown that 4-cycle-free Tanner graphs do not exist for many classical binary linear block codes
设C是一个[n, k, d]二进制线性码，速率R = k/n，对偶cbp。在这种对应关系中，证明了C可以用一个无4圈的Tanner图表示，只有当pdperp小于lfloorradicnp(p-1)+n2/4+n/2rfloor，其中p = n - k，且dperp是Cperp的最小距离。应用这一结果，证明了许多经典二进制线性分组码不存在无4环Tanner图
{"title":"Which Codes Have 4-Cycle-Free Tanner Graphs?","authors":"T. Halford, K. Chugg, A. Grant","doi":"10.1109/ISIT.2006.261717","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261717","url":null,"abstract":"Let C be an [n, k, d] binary linear code with rate R = k/n and dual Cperp. In this correspondence, it is shown that C can be represented by a 4-cycle-free Tanner graph only if: pdperp les lfloorradicnp(p-1)+n2/4+n/2rfloor where p = n - k and dperp is the minimum distance of Cperp . By applying this result, it is shown that 4-cycle-free Tanner graphs do not exist for many classical binary linear block codes","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83432897","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261583
B. Frey
Summary form only given, as follows. Construction of the discrete genome sequence was the fi rst step in developing a comprehensive understanding of how cellular processes are controlled by bio-molecules and their interactions. That step is now mostly complete and the next step is to determine how DNA subsequences encode instructions for producing RNA transcripts and how continuous abundances of transcripts in cells combine to control activities. This is a much more challenging task than genome assembly, because the encoding of genetic instructions turns out to be far richer than was previously thought, and the detection and analysis of continuous cellular signals is more diffi cult than discrete symbol detection. Only preliminary progress has been made in assembling and analyzing the 'transcriptome' and the fi rst genome-wide data sets enabling the study of transcripts and their interactions have only recently been published. In this talk, I'll describe several open research problems in this area and discuss how they can be approached using representations and algorithms familiar to researchers in the information theory community.
{"title":"Beyond genomics: Detecting codes and signals in the cellular transcriptome [Plenary speakers]","authors":"B. Frey","doi":"10.1109/ISIT.2006.261583","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261583","url":null,"abstract":"Summary form only given, as follows. Construction of the discrete genome sequence was the fi rst step in developing a comprehensive understanding of how cellular processes are controlled by bio-molecules and their interactions. That step is now mostly complete and the next step is to determine how DNA subsequences encode instructions for producing RNA transcripts and how continuous abundances of transcripts in cells combine to control activities. This is a much more challenging task than genome assembly, because the encoding of genetic instructions turns out to be far richer than was previously thought, and the detection and analysis of continuous cellular signals is more diffi cult than discrete symbol detection. Only preliminary progress has been made in assembling and analyzing the 'transcriptome' and the fi rst genome-wide data sets enabling the study of transcripts and their interactions have only recently been published. In this talk, I'll describe several open research problems in this area and discuss how they can be approached using representations and algorithms familiar to researchers in the information theory community.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73776697","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261724
R. Zamir, Y. Kochman, U. Erez
The "water-filling" solution for the quadratic rate-distortion distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain "test-channel" realization. We provide an alternative time-domain realization for the rate-distortion function, based on linear prediction. This solution has some interesting implications, including the optimality at all distortion levels of pre/post filtered vector-quantized differential pulse code modulation (DPCM), and a duality relationship with decision-feedback equalization (DFE) for inter-symbol interference (ISI) channels.
{"title":"Achieving the Gaussian Rate-Distortion Function by Prediction","authors":"R. Zamir, Y. Kochman, U. Erez","doi":"10.1109/ISIT.2006.261724","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261724","url":null,"abstract":"The \"water-filling\" solution for the quadratic rate-distortion distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain \"test-channel\" realization. We provide an alternative time-domain realization for the rate-distortion function, based on linear prediction. This solution has some interesting implications, including the optimality at all distortion levels of pre/post filtered vector-quantized differential pulse code modulation (DPCM), and a duality relationship with decision-feedback equalization (DFE) for inter-symbol interference (ISI) channels.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83509235","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261680
N. Sommer, M. Feder, O. Shalvi
Low density lattice codes (LDLC) are novel lattice codes that can approach the capacity of the additive white Gaussian noise (AWGN) channel and be decoded efficiently. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. The fact that H is sparse is utilized to develop a linear-time iterative decoding scheme which attains, as demonstrated by simulations, good error performance within ~ 0.5 dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations
低密度点阵码(LDLC)是一种接近加性高斯白噪声(AWGN)信道容量并能有效解码的新型点阵码。在LDLC中，码字x直接在n维欧氏空间上作为对应的整数消息向量b的线性变换生成，即x = Gb，其中H = G -1被限制为稀疏。利用H是稀疏的这一事实，开发了一种线性时间迭代解码方案，如仿真所示，在块长度为n = 100,000个符号的容量下，该方案在~ 0.5 dB内具有良好的误差性能。本文还讨论了收敛结果和实现注意事项
{"title":"Low Density Lattice Codes","authors":"N. Sommer, M. Feder, O. Shalvi","doi":"10.1109/ISIT.2006.261680","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261680","url":null,"abstract":"Low density lattice codes (LDLC) are novel lattice codes that can approach the capacity of the additive white Gaussian noise (AWGN) channel and be decoded efficiently. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. The fact that H is sparse is utilized to develop a linear-time iterative decoding scheme which attains, as demonstrated by simulations, good error performance within ~ 0.5 dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77391569","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 : 2006-07-09DOI: 10.1109/ISIT.2006.261665
Kai Li, Xiaodong Wang
In this paper, we propose a new multi-rate multiple-access wireless system implemented by variable spreading gain and chip-level random interleaving. Optimization across the physical and network layers in the uplink of such a system is also treated. A multi-criterion reinforcement learning (MCRL)-based adaptive call admission control (CAC) method is proposed which can easily handle multiple average QoS requirements.
{"title":"Cross-layer Optimization for LDPC-coded Multi-rate Multiuser Systems with QoS Constraints","authors":"Kai Li, Xiaodong Wang","doi":"10.1109/ISIT.2006.261665","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261665","url":null,"abstract":"In this paper, we propose a new multi-rate multiple-access wireless system implemented by variable spreading gain and chip-level random interleaving. Optimization across the physical and network layers in the uplink of such a system is also treated. A multi-criterion reinforcement learning (MCRL)-based adaptive call admission control (CAC) method is proposed which can easily handle multiple average QoS requirements.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87935548","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 : 2006-07-09DOI: 10.1109/ISIT.2006.262070
A. Dimakis, A. Gohari, M. Wainwright
A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation decoding. We begin by showing that for expander codes, every fractional pseudocodeword always has at least a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We exploit this fact to devise a decoding algorithm that provably outperforms the LP decoder for finite blocklengths. It proceeds by guessing facets of the polytope, and resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that for expander codes the proposed algorithm succeeds even with a constant number of pseudocodewords of higher likelihood. Moreover, the complexity of the proposed algorithm is only a constant factor larger than that of the LP decoder.
{"title":"Guessing Facets: Polytope Structure and Improved LP Decoding","authors":"A. Dimakis, A. Gohari, M. Wainwright","doi":"10.1109/ISIT.2006.262070","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262070","url":null,"abstract":"A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation decoding. We begin by showing that for expander codes, every fractional pseudocodeword always has at least a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We exploit this fact to devise a decoding algorithm that provably outperforms the LP decoder for finite blocklengths. It proceeds by guessing facets of the polytope, and resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that for expander codes the proposed algorithm succeeds even with a constant number of pseudocodewords of higher likelihood. Moreover, the complexity of the proposed algorithm is only a constant factor larger than that of the LP decoder.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75176361","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 : 2006-07-09DOI: 10.1109/ISIT.2006.262111
K. Censor-Hillel, T. Etzion
A binary sequence satisfies a one-dimensional (d, k) constraint if every run of zeroes has length at least d and at most k. A binary two-dimensional array satisfies a (d, k) constraint if every run of zeroes, in each one of the array directions, has length at least d and at most k. Few models have been proposed in the literature to handle two dimensional data: the diamond model, the square model, the hexagonal model, and the triangular model. The constraints in the different directions might be asymmetric and hence many kind of constraints are defined depending on the number of directions in the model. For example, a two-dimensional array in the diamond model satisfies a (d1, k1, d2, k2) constraint if it satisfies the one-dimensional (d1, k1) constraint horizontally and the one-dimensional (d2, k2) constraint vertically. In this paper we examine the region in which the capacity of the constraints is zero or positive in the various models. We consider asymmetric constraints in the diamond model and symmetric constraints in the other models. In particular we provide an almost complete solution for asymmetric constraints in the diamond model.
{"title":"The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels","authors":"K. Censor-Hillel, T. Etzion","doi":"10.1109/ISIT.2006.262111","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262111","url":null,"abstract":"A binary sequence satisfies a one-dimensional (d, k) constraint if every run of zeroes has length at least d and at most k. A binary two-dimensional array satisfies a (d, k) constraint if every run of zeroes, in each one of the array directions, has length at least d and at most k. Few models have been proposed in the literature to handle two dimensional data: the diamond model, the square model, the hexagonal model, and the triangular model. The constraints in the different directions might be asymmetric and hence many kind of constraints are defined depending on the number of directions in the model. For example, a two-dimensional array in the diamond model satisfies a (d1, k1, d2, k2) constraint if it satisfies the one-dimensional (d1, k1) constraint horizontally and the one-dimensional (d2, k2) constraint vertically. In this paper we examine the region in which the capacity of the constraints is zero or positive in the various models. We consider asymmetric constraints in the diamond model and symmetric constraints in the other models. In particular we provide an almost complete solution for asymmetric constraints in the diamond model.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83293390","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 : 2006-05-21DOI: 10.1109/ISIT.2006.261639
L. Ong, M. Motani
In this paper, we derive the capacity of a special class of mesh networks. A mesh network is defined as a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We find the capacity of the mesh network when there is one source, one destination, and multiple relays. We call this channel the single source multiple relay single destination (SSMRSD) mesh network. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in the Gaussian setting. We then show that the bound is achievable asymptotically using the compress-forward strategy for the multiple relay channel. Theoretically, the results indicate the value of cooperation and the utility of carefully deployed relays in wireless ad-hoc and sensor networks. The capacity characterization quantifies how the relays can be used to either conserve node energy or to increase transmission rate
{"title":"The Capacity of the Single Source Multiple Relay Single Destination Mesh Network","authors":"L. Ong, M. Motani","doi":"10.1109/ISIT.2006.261639","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261639","url":null,"abstract":"In this paper, we derive the capacity of a special class of mesh networks. A mesh network is defined as a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We find the capacity of the mesh network when there is one source, one destination, and multiple relays. We call this channel the single source multiple relay single destination (SSMRSD) mesh network. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in the Gaussian setting. We then show that the bound is achievable asymptotically using the compress-forward strategy for the multiple relay channel. Theoretically, the results indicate the value of cooperation and the utility of carefully deployed relays in wireless ad-hoc and sensor networks. The capacity characterization quantifies how the relays can be used to either conserve node energy or to increase transmission rate","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81574937","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
扫码关注我们
求助内容：
应助结果提醒方式：