检索结果-内蒙古大学图书馆

Molecular cloning of a gene encoding matrix metalloproteinase-like protein from Gnathostoma spinigerum

PARASITOLOGY RESEARCH 2001年第9期87卷 751-757页

作者： Uparanukraw, P Morakote, N Harnnoi, T Dantrakool, A Chiang Mai Univ Fac Med Dept Parasitol Chiang Mai 50200 Thailand

The advanced third-stage larvae (aL3) of Gnathostoma spinigerum contain a 24 kDa glycoprotein with diagnostic potential. Immunoscreening with the monoclonal antibody to the 24-kDa protein (mAb GN6/24) has identified a cDNA clone with an insert of 932 base pairs (bp). The insert contains a full-length gene of 732 bp encoding a protein that is 33-39% similar to matrix metalloproteinases (MMPs) of Caenorhabditis elegans and several lower and higher vertebrates. The MMP-like protein of G. spinigerum possesses the catalytic domain, but lacks the propeptide and hemopexin-like domains found in other MMPs. A signal peptide of 23 amino acids at its amino terminus indicates that it is a secretory protein, which is confirmed by Western blot analysis showing the presence of the 24 kDa protein in the excretory-secretory products of aL3.

关键词： encoding Proteins Infection by Gnathostoma spinigerum matrix Metalloproteinases 蛋白质类 excretory-secretory products Molecular cloning encoding matrix inserts matrix Metalloproteinases Protein GNATHOSTOMA SPINIGERUM Signal Peptides vif Genes Metalloproteases Catalytic Domain secretory protein Monoclonal Antibodies coding

来源：评论

学校读者我要写书评

暂无评论

A class of binary MDS array codes with asymptotically weak-optimal repair

引用

Science China(Information Sciences) 2018年第10期61卷 52-62页

作者： Hanxu HOU Yunghsiang S.HAN School of Electrical Engineering & Intelligentization Dongguan University of Technology

Binary maximum distance separable(MDS) array codes contain k information columns and r parity columns in which each entry is a bit that can tolerate r arbitrary erasures. When a column in an MDS code fails, it has been proven that we must download at least half of the content from each helper column if k + 1 columns are selected as the helper columns. If the lower bound is achieved such that the k + 1 helper columns can be selected from any k + r-1 surviving columns, then the repair is an optimal ***, if the lower bound is achieved with k + 1 specific helper columns, the repair is a weak-optimal repair. This paper proposes a class of binary MDS array codes with k 3 and r 2 that asymptotically achieve weak-optimal repair of an information column with k + 1 helper columns. We show that there exist many encoding matrices such that the corresponding binary MDS array codes can asymptotically achieve weak-optimal repair for repairing any information column.

关键词： MDS codes binary MDS array codes optimal repair encoding matrix asymptotically weakoptimal repair

来源：评论

学校读者我要写书评

暂无评论

Outage probability analysis of cognitive relay network with four relay selection and end-to-end performance with modified quasi-orthogonal space-time coding

引用

IET COMMUNICATIONS 2014年第2期8卷 233-241页

作者： Manna, Mustafa Abdelaziz Chen, Gaojie Chambers, Jonathon A. Univ Loughborough Sch Elect Elect & Syst Engn Loughborough LE11 3TU Leics England Univ Loughborough Dept Elect & Elect Engn Loughborough LE11 3TU Leics England

In this study, the authors evaluate the outage probability performance of an amplify-and-forward cooperative relay network where the relays are equipped with cognitive radios. When the number of available relays is more than four the authors use the channel conditions in order to select the best four cognitive relays from a set of M cognitive relay nodes and then they are used for cooperation between the source and the destination nodes. Expressions for outage probability are determined for a frequency flat Rayleigh-fading environment from the received signal-to-noise ratio with perfect and imperfect spectrum acquisition. In addition, a modified distributed quasi-orthogonal space-time block coding scheme with increased code gain distance is considered for use within the proposed cognitive relay network. To utilise the available spectrum opportunities with the modified quasi-orthogonal space-time block code, the code matrix can be adapted to the number of available relays. Simulation results show that the four relay selection improves the system performance. This is confirmed by the outage probability analysis. The simulations also show that the modified code can significantly enhance the performance of the system and improve the reliability of the link as compared with the conventional distributed quasi-orthogonal space-time block coding.

关键词： System performance Probabilistic analysis time coding Relay networks relay end-to-end performance encoding matrix Cognitive radio quasi-orthogonal

来源：评论

学校读者我要写书评

暂无评论

A PRAGMATIC APPROACH SPACE-TIME CODE DESIGN

引用

IEEE VEHICULAR TECHNOLOGY MAGAZINE 2010年第1期5卷 91-96页

作者： Ismail, Amr Sari, Hikmet Fiorina, Jocelyn Supelec Dept Telecommun Gif Sur Yvette France

In multiple-input multiple-output (MIMO) systems, the signals transmitted from different antennas are described by a space-time code (STC) matrix, whose properties determine the system performance. Basically, STC design attempts to provide full diversity and high coding gain, and some design techniques also include a complexity criterion to limit the maximum-likelihood (ML) decoder complexity. A closer look at the code matrix reveals that, in all STCs, the matrix elements are a linear combination of the symbol block to be transmitted and can be regarded as new symbols taking their values from a higher signal constellation. However, the signal points in the new constellation are not regularly spaced as in traditional signal constellations.

关键词： Signs and symbols encoding matrix multiple input multiple output systems space-time codes matrices CONSTELLATIONS Linear Combination design techniques Infectious Disease Transmission Constellation diagram SINGLE STRIP CONTAINERS signals coding gain

来源：评论

学校读者我要写书评

暂无评论

A new class of Fibonacci sequence based error correcting codes

引用

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES 2017年第3期9卷 379-396页

作者： Esmaeili, M. Moosavi, M. Gulliver, T. A. Isfahan Univ Technol Dept Math Sci Esfahan *** Iran Univ Victoria Dept Elect & Comp Engn POB 1700 Victoria BC V8W 2Y2 Canada

A new class of matrices is introduced for use in error control coding. This extends previous results on the class of Fibonacci error correcting codes. For a given integer p, a (p + 1) x (p + 1) binary matrix M-p is given whose nonzero entries are located either on the superdiagonal or the last row of the matrix. The matrices M-p(n) and M-p(-n), the nth power of M-p and its inverse, are employed as the encoding and decoding matrices, respectively. It is shown that for sufficiently large n, independent of the message matrix M, relations exist among the elements of the encoded matrix E = M x M-p(n). These relations play a key role in the error detection and correction.

关键词： Fibonacci coding encoding matrix Fibonacci sequence

来源：评论

学校读者我要写书评

暂无评论

I/O-Efficient Scaling Schemes for Distributed Storage Systems with CRS Codes

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2016年第9期27卷 2639-2652页

作者： Wu, Si Xu, Yinlong Li, Yongkun Yang, Zhijia Univ Sci & Technol China Sch Comp Sci & Technol Hefei Peoples R China Univ Sci & Technol China AnHui Prov Key Lab High Performance Comp Hefei Peoples R China Natl Univ Def Technol Collaborat Innovat Ctr High Performance Comp Changsha 410073 Hunan Peoples R China

System scaling becomes essential and indispensable for distributed storage systems due to the explosive growth of data volume. Considering that fault-protection is a necessity in large-scale distributed storage systems, and Cauchy Reed-Solomon (CRS) codes are widely deployed to tolerate multiple simultaneous node failures, this paper studies the scaling problem of distributed storage systems with CRS codes. In particular, we formulate the scaling problem with an optimization model in which both the post-scaling encoding matrix and the data migration policy are assumed to be unknown in advance. To minimize the I/O overhead, we propose a three-phase optimization scaling scheme for CRS codes. Specifically, we first derive the optimal post-scaling encoding matrix under a given data migration policy, then optimize the data migration process using the selected post-scaling encoding matrix, and finally exploit the Maximum Distance Separable (MDS) property to further optimize the designed data migration process. Our scaling scheme requires minimal data movement while achieving uniform data distribution. Moreover, it requires to read fewer data blocks than conventional minimum data migration schemes, but still guarantees the minimum amount of migrated data. To validate the efficiency of our scheme, we implement it atop a networked file system. Extensive experiments show that our scaling scheme uses less scaling time than the basic scheme.

关键词： Scaling cauchy reed-solomon codes distributed storage systems encoding matrix data migration

来源：评论

学校读者我要写书评

暂无评论

On the Equivalence Between Canonical Forms of Recursive Systematic Convolutional Transducers Based on Single Shift Registers

引用

IEEE ACCESS 2014年 2卷 381-394页

作者： Balta, Horia Douillard, Catherine Isar, Alexandru Univ Politehn Timisoara Timisoara 300223 Romania Valahia Univ Targoviste Targoviste 130024 Romania Inst Mines Telecom Telecom Bretagne F-75634 Paris 13 France

Standardized turbo codes (TCs) use recursive systematic convolutional transducers of rate b/(b + d), having a single feedback polynomial (b+dRSCT). In this paper, we investigate the realizability of the b+dRSCT set through two single shift register canonical forms (SSRCFs), called, in the theory of linear systems, constructibility, and controllability. The two investigated SSRCF are the adaptations, for the implementation of b+dRSCT, of the better-known canonical forms controller (constructibility) and observer (controllability). Constructibility is the implementation form actually used for convolutional transducers in TCs. This paper shows that any b+1RSCT can be implemented in a unique SSRCF observer. As a result, we build a function, xi:H -> G, which has as definition domain the set of encoders in SSRCF constructibility, denoted by H, and as codomain a subset of encoders in SSRCF observer, denoted by G. By proving the noninjectivity and nonsurjectivity properties of the function xi, we prove that H is redundant and incomplete in comparison with G, i.e., the SSRCF observer is more efficient than the SSRCF constructibility for the implementation of b+1RSCT. We show that the redundancy of the set H is dependent on the memory m and on the number of inputs b of the considered b+1RSCT. In addition, the difference between G and xi(H) contains encoders with very good performance, when used in a TC structure. This difference is consistent for m approximate to b > 1. The results on the realizability of the b+1RSCT allowed us some considerations on b+dRSCT, with b, d > 1, as well, for which we proposed the SSRCF controllability. These results could be useful in the design of TC based on exhaustive search. So, the proposed implementation form permits the design of new TCs, which cannot be conceived based on the actual form. It is possible, even probable, among these new TCs to find better performance than in the current communication standards, such as LIE, DVB, or deep-spac

关键词： Canonical forms convolutional encoders equivalence encoding matrix turbo codes

来源：评论

学校读者我要写书评

暂无评论

Convolutional codes over integer rings suitable for parallel and serial concatenation

引用

ELECTRONICS LETTERS 2003年第9期39卷 726-727页

作者： Berkmann, J Infineon Technol AG D-81669 Munich Germany

Choosing a convolutional encoder over a ring with feedback may not lead to a suitable component code for parallel or serial concatenation. A simple criterion is derived that allows to check whether a rational encoding matrix generating some convolutional code over the integer ring Z(pm) (p prime) has exclusively infinite impulse responses.

关键词： Parallel Lines encoding matrix Feedback convolutional coder IMPULSE RESPONSE convolutional coding Integer

来源：评论

学校读者我要写书评

暂无评论

Unitary matrices for phase-coded holographic memories

引用

OPTICS LETTERS 2006年第8期31卷 1047-1049页

作者： Zhang, XZ Berger, G Dietz, M Denz, C Univ Munster Inst Angew Phys D-48149 Munster Germany

We propose a novel type of unitary matrix for phase-code multiplexed holographic memories, which could be quickly generated from geometric sequences. Our analysis shows that the phase-code matrices are unitary rather than orthogonal. The new matrices have complex elements. The order of unitary matrices can be any positive integer, so that we can accommodate the available spatial light modulators to obtain the maximum possible storage capacity. The cross-talk noises in phase-encoded memories with unitary matrices and with Hadamard matrices are of the same order of magnitude, which are much lower than those in holographic memories with wavelength multiplexing or angle multiplexing. (c) 2006 Optical Society of America.

关键词： phase coding encoding matrix Storage capacity Unitary matrix Unitary Holography Wavelength multiplexing Hadamard matrices holographic storage

来源：评论

学校读者我要写书评

暂无评论

Optimizing Image Reconstruction in SENSE Using GPU

引用

APPLIED MAGNETIC RESONANCE 2018年第2期49卷 151-164页

作者： Qazi, Sohaib A. Nasir, Saima Saeed, Abeera Omer, Hammad COMSATS Inst Informat Technol Dept Elect Engn Islamabad Pakistan

Parallel magnetic resonance imaging (MRI) (pMRI) uses multiple receiver coils to reduce the MRI scan time. To accelerate the data acquisition process in MRI, less amount of data is acquired from the scanner which leads to artifacts in the reconstructed images. SENSitivity encoding (SENSE) is a reconstruction algorithm in pMRI to remove aliasing artifacts from the undersampled multi coil data and recovers fully sampled images. The main limitation of SENSE is computing inverse of the encoding matrix. This work proposes the inversion of encoding matrix using Jacobi singular value decomposition (SVD) algorithm for image reconstruction on GPUs to accelerate the reconstruction process. The performance of Jacobi SVD is compared with Gauss-Jordan algorithm. The simulations are performed on two datasets (brain and cardiac) with acceleration factors 2, 4, 6 and 8. The results show that the graphics processing unit (GPU) provides a speed up to 21.6 times as compared to CPU reconstruction. Jacobi SVD algorithm performs better in terms of acceleration in reconstructions on GPUs as compared to Gauss-Jordan method. The proposed algorithm is suitable for any number of coils and acceleration factors for SENSE reconstruction on real time processing systems.

关键词： Reconstruction algorithm speedup factor encoding matrix data acquisition and processing image reconstruction Multiple Receiver GRAPPER PICK UP Scanner acceleration Graphics Processing Unit

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：