矢量量化法用于改进的多带激励声码器—一种极低比特率语音…

在低比特率语音编码方法中，改进的多带激励编码方法可得到低噪声和稳健性强的重建语音，但运算量很大，作在改进的多带激励编码研究中，将矢量量化方法引入频谱幅度的量化，不仅降低了运算量而且降低了编码比特率，使得在１．３５￣１．８ｋｂｉｔ／ｓ的编码比特率下的重建语音，与４．８ｋｂｉｔ／ｓ编码比特率下（按自激励声码器编码方法）重建的语音质量相比毫不逊色。     

各种速率矢量和激励线性预测（VSELP）编码器的实现

研究并改进了矢量和激励线性预测，语音编码器，介绍了８ｋｂｉｔ／ｓＶＳＥＬＰ编码方案的实现及在此基础上利用矢量量化ＬＰＣ参数，减少激励码本数和子块分裂等方法；改进的６．４ｋｂｉｔ／ｓ，４．８ｋｂｉｔ／ｓ及２．４ｋｂｉｔ／ｓ ＶＳＥＬＰ的方案和结果。     

实时低速率语音压缩编码的算法研究

针对数字化通信网及多媒体应用中低速率数字语音编码问题，以多带激励（ＭＢＥ）声码器为模型，采用了一些新算法去降低编码速率和改善音质。利用动态规划算法对基音周期进行平滑，去除了声码器中常有的音调噪声。利用ＬＰＣ全极点模型谱逼近ＭＢＥ谱包络，并采用共振峰增强技术来补偿模型误差，有效地降低了编码速率。为了能够实时实现这个编码系统，采用了分裂矢量量化，多级矢量量化和前向多层人工神经网络等技术进行优化和改善，使之在２．４ｋｂｉｔ／ｓ，１．２ｋｂｉｔ／ｓ及８００ｂｉｔ／ｓ等速率上实时实现了较高质量的语音压缩编码。     

一种改进的规则脉冲激励－长时预测语音编码方案

在对规则脉冲激励－长时预测语音编码方案（比特率为１３ｋｂｉｔ／ｓ）研究的基础上，提出了７．４ｋｂｉｔ／ｓ的改进方案，使编码速率大大降低．改进方案在长时预测分析中用部分搜索法代替了原来的全搜索，并采用矢量量化技术对预测残差信号进行量化．其硬件实现在ＴＭＳ３２０Ｃ３０ＥＶＭ上完成，所用ＤＳＰ芯片为单片ＴＭＳ３２０Ｃ３０．实验结果表明，合成语音质量与原方案十分接近．     

高质量4kbit/s码速率语音编码算法研究

４ｋｂｉｔ／ｓ有限状态代数码激励线性预测语音编码算法ＦＳ－ＡＣＥＬＰ是一种具有延时较短、合成语音质量高、算法复杂度较低的语音编码算法。在线性预测（ＬＰ）参数量化上,利用了语音帧内和帧间的相关性,对线谱对（ＬＳＰ）参数使用预测式分裂式矢量量化,获得很高的量化效率。在自适应码本搜索上,采用了有限状态控制分数延时搜索的算法,在保证合成语音质量的同时,有效地降低了运算量。对于随机码本,采用了具有多模结构的代数码本,提高语音合成质量。对于激励码序列的增益,采用了预测式矢量量化,有效地提高了量化精度。经非正式听音测试,４ｋｂｉｔ／ｓＦＳ－ＡＣＥＬＰ的合成语音质量超过了北美８ｋｂｉｔ／ｓＶＳＥＬＰ,接近Ｇ．７２９８ｋｂｉｔ／ｓＣＳ－ＡＣＥＬＰ,ＭＯＳ分约为３．９。     

一种改进的规则脉冲激励—长时预测语音编码方案

在对规则脉冲激励－长时预测语音编码方案（比特率为１３ｋｂｉｔ／ｓ）研究的基础上，提出了７．４ｋｂｉｔ／ｓ的改进方案，使编码速度大大降低，改进方案在长时预测分析中用部分搜索法代替了原来的全搜索，并采用矢量量化技术对预测残差信号进行量化，其硬件实现在ＴＭＳ３２０Ｃ３０ ＥＶＭ上完成，所用ＤＳＰ芯片为单片ＴＭＳ３２０Ｃ３０，实验结果表明，合成语音质量与原方案十分接近。     

1.8kb/s多带线性预测编码算法设计

设计了一种多带线性预测编码(MBLPC)语音压缩算法，该算法结合正弦编码和线性预测编码的优点，对语音信号的包络谱用线性预测编码方法进行估计．而对激励谱用多带方式进行处理．改进了特征参数的提取和量化方法，包括基于谐振结构的基音检测算法、基于谐振结构的线性预测分析以及包络谱参数的线性预测多层分裂码本矢量量化．非正式主观测试表明，在1．8kb／s编码速率下，由MBLPC算法所重建语音的平均意见分为3．0，而清晰度指标约为91％．     

8 kbit/s 短延时语音编码算法——LD-ACELP

８ｋｂｉｔ／ｓ短延时语音编码算法ＬＤ－ＡＣＥＬＰ，采用了代数码本激励线性预测（ＡＣＥＬＰ）的编码方法，利用语音的帧间相关性对线谱对参数采用了分裂式矢量量化技术，并采用高效的码本结构、码本搜索技术和增益矢量量化技术来获得较高的语音合成质量和较短的算法延时。ＬＤ－ＡＣＥＬＰ的帧长为１０ｍｓ，算法延时为１５ｍｓ。通过信噪比及人耳主观听觉实验等性能测试表明，该算法具有与国际电联１６ｋｂ／ｓ短延时语音编码算法ＬＤ－ＣＥＬＰ（Ｇ．７２８）相当的语音合成质量。     

2.4 kb/s MELP算法设计

提出了一种新的工作于低极码率下的混合激励线性预测（ＭＥＬＰ）声码器。该声码器结合了线性预测编码（ＬＰＣ）和多带激励编码算法的优点,对算法和量化方案重新进行了设计和改造,其主要特征包括改进的基音检测算法、混合的周期脉冲和随机噪声激励,有效的线性谱频率（ＬＰＦ）参数量化以及激励谱形状表示,非正式主观测试表明,由采用本算法的一个２．４ｋｂ／ｓ编码器所重建的语音质量略优于美国联邦标准４．８ｋｂ／ｓ码激励性     

16kb／s7kHz宽带语音编码器的研究

分析了宽带语音编解码过程中遇到的特殊问题和解决办法,并通过改进窄带语音ＴＣＸ算法（主要包括系统合成滤波器的移位和将频域矢量分成高低两个矢量）实现了宽带语音压缩编码．该算法的运算量仅相当于一般ＣＥＬＰ运算量的１／２,降低了对所用ＤＳＰ的速度要求．实验证明重建语音质量有了明显改善,信噪比提高近３ｄＢ,主观听觉质量也有明显改善．同时还分析了频域量化对该系统的编码噪声的影响,认为２ｂｉｔ／ｓａｍｐｌｅ来量化相位是比较恰当的,这样能充分发挥ＴＣＸ算法优越性,获得较理想的编码效果．     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.