结合信源和信道的多级矢量量化联合优化算法

针对传统的信源优化多级矢量量化抗误码性能较差的问题,提出了一种结合信源和信道的多级矢量量化码本联合优化算法。该算法将码本联合优化与非等重信道保护相结合,充分利用多级矢量量化中各级码字之间的相互作用关系和非等重信道保护的特性,对各级码字进行非等重误码率的迭代优化来降低整个系统失真。在低速率语音编码中线谱频率参数的仿真测试表明:与信道优化的多级矢量量化独立码本和非等重信道保护相结合的方案相比,在8%误码率信道下该算法线谱频率参数的平均谱失真降低了0.1dB;与等重误码率的码本联合优化方案相比,在各种误码率信道下该算法线谱频率参数的平均谱失真都有明显降低。     

高质量的0.6 kb/s声码器算法

为满足语音信息存贮和交流对极低速率下语音压缩编码的需求,提出了一种0.6 kb/s声码器算法.此算法基于线性预测正弦激励模型,在极低码率下获得高质量的合成语音,提出清浊音定位和量化方法,应用了多帧参数联合矢量量化技术,以及多带正弦混合激励、谱增强等技术.主观听觉测试显示,在0.6 kb/s的速率下,此声码器合成语音不仅具有高可懂度而且具有一定的自然度,诊断押韵测试(DRT)的分数为89.5%, 而且在10-2的随机误码的信道条件下仍然具有很好的可懂度.实验表明 利用帧间参数相关性及矢量量化的方法可以将编码速率大幅度压低而保持较高清晰度.     

SELP声码器参数抗差错恢复算法

针对低速率语音编码领域的正弦激励线性预测(SELP)声码器,提出了一种错误帧参数修复算法。对于信道编解码不能纠错的语音帧,算法根据信道解码后所指示的错误信息,结合解码端各参数平稳性的不同,采用参数替换方法分别进行修复。测试结果表明:采用该算法,在1%、3%、5%的随机信道误码下,声码器抗误码性能均有较大改善,特别是在5%的较高信道误码率下,合成语音平均意见得分提高了0.2以上。     

0.8 kb/s高质量声码器算法

随着通信的发展,对极低速率下语音压缩编码算法的需求越来越迫切.为满足极低码率的要求并获得高质量的合成语音,提出了一种高质量的0.8 kb/s 声码器算法.此算法基于传统的线性预测模型,利用多帧联合的超级帧参数分模式联合矢量量化技术,以及多带混合激励,子带清浊音参数相关预测,自适应谱增强,脉冲扩散后滤波等技术.主观听觉测试显示,此声码器在0.8 kb/s的速率下其合成语音不仅具有高可懂度而且具有一定的自然度,诊断押韵测试(DRT)的分数为85%,而且此声码器在10-2的随机误码的信道条件下仍然具有很好的可懂度.     

语音模糊特征提取及码本训练算法

为克服低速率声码器因清浊音硬判决、粗判决而导致解码语音有帧过渡等不自然感的缺陷,在分析比较目前主流声码器编码算法中激励参数提取和量化算法的基础上,将模
糊数学中的隶属度概念引入语音子带清浊音描述。提出了五维的浊音隶属度矢量概念,用于精细描述语音丰富的激励信息;阐述了浊音隶属度矢量的提取算法;提出了矢量量化码本的模糊聚类与LBG级联训练算法（F-LBG：Fuzzy-LBG）;采用提取算法提取、建立了浊音隶属度码本的训练样本集,采用F-LBG训练了浊音隶属度码本;将提取算法和F-LBG法训练得到的浊音隶属度码本分别应用于正弦激励声码器、混合激励声码器和同态声码器的语音编、解码仿真。结果表明,用浊音隶属度矢量描述合成语音激励信号的算法,具有较高的准确性和较强的噪声鲁棒性。     

声码器线谱对参数抗信道误码算法

为降低在窄带高误码率信道上语音传输的失真,针对线谱对参数提出了一种基于信源信道联合特性的声码器线谱对参数抗误码算法.该算法首先对声码器模式信息采用结合长时统计特性的改进最大后验概率算法进行恢复,然后对语音合成质量影响最大的线谱对参数进行基于前向统计概率和分模式加权的最小均方误差准则下的线谱对参数差错后处理.该算法在不消耗任何额外带宽且无算法延时的要求下,可以显著降低线谱对参数谱失真,提高声码器抗信道误码能力和信道误码条件下的合成语音质量.特别在较高信道误码率(5%)下,平均谱失真降低0.3, MOS(mean opinion score)平均提高15%左右.     

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

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

基于MMSE的声码器解码算法

为满足在高误码率的窄带信道上进行语音通信的需求 ,研究了一种适用于甚低速率语音通信的抗误码参数估值算法。基于一定的解码状态 ,声码器通过最小均方误差(MMSE)估计的方法估计最优参数 ,充分降低信道误码对重建语音质量的影响。对于解码状态参数 ,通过计算最大后验转移概率的方法作最佳估计 ,并给出了一种简化的估计方法。这种抗误码算法计算量小 ,算法复杂度低。仿真结果表明 ,在不同误码率下用该算法恢复出的重建语音 ,不论客观评价或是主观评价 ,其质量都要优于传统的帧删除掩盖方法     

基于SVD和伪随机循环链的图像认证水印算法

针对矩阵的行列互换使得奇异值分解(SVD)后的奇异值不变,从而由奇异值直接产生水印安全性不高,以及基于SVD的图像认证水印算法把块水印嵌入本图像块的最低有效位,从而很难抵抗矢量量化攻击,提出了基于SVD和由Logistic混沌系统构成伪随机循环链的图像认证水印算法.首先通过Logistic混沌系统调制图像,使得图像矩阵唯一,然后将调制后图像块奇异值生成的块水印嵌入伪随机循环链对应图像块最低有效位.实验结果显示,该算法提高了水印的安全性,不仅能够准确定位,而且可以有效抵抗矢量量化攻击.     

面向无线信道的H.26L编码模式判决策略

在对H．26L视频编码中帧内帧间宏块编码失真和传输误码失真及扩散的理论分析基础上，提出了一种面向无线信道的H．26L编码模式率失真优化判决策略。考虑在编码模式选择时结合信道误码扩散模型，通过简化的率失真判决策略，使编码视频流具有很好的自适应误码恢复能力，且计算复杂度较低。典型无线信道环境中的测试结果表明，在增加不多计算量的情况下，该算法比传统方法具有更强的抗误码鲁棒性。     

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).     

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.