Sobolev空间的伪平移框架

根据Sobolev空间Hs(R)(s0)中平移框架的等价条件,验证了生成子不能同时具有很好的时-频局部性质.并通过引入伪框架的定义,成功地克服了平移框架的上述缺点.     

关于规范紧框架超小波若干问题的研究

给出了规范紧框架超小波的3个重要结论。①空间L(R)(m)中长度为m的规范紧框架超小波可扩展为较大空间L(R)(m+1)中长度为m+1的超小波,也即空间L(R)(m)的规范紧超小波框架可扩展为较大空间L(R)(m+1)的规范正交基。从而为规范紧框架超小波与超小波搭起了桥梁。②借助于酉等价性,讨论了规范紧框架超小波的等价性.给出一个长度为m的规范紧框架超小波当最后一个分量用酉等价的规范紧框架小波代替时,所形成的仍然是一个规范紧框架超小波。③改进了规范紧框架超小波定义的条件,利用空间理论,给出了判定规范紧框架超小波的一个充分条件。该条件较定义中的条件相对简单，利用泛函分析对这些结论给出了证明，这些结论给处理超空间中的信号提供了重要的理论依据。     

基于框架的L~2(R)子空间的抽样定理

讨论了L(2R)平移不变子空间中基于框架的非整点抽样定理,得到了抽样函数在频域中的表示形式以及非整点抽样定理在L(2R)平移不变子空间中成立的充要条件.     

a尺度广义多分辨结构与平移伪框架

引进了函数空间L2(R)中的a(2a∈Z)尺度广义多分辨结构与平移伪框架的概念,给出了它的塔式分解格式及其存在的条件,进而得到平方可积函数空间的函数仿射框架展式.推广了双正交小波的概念.     

基于Parseval框架的多小波子空间抽样定理

研究了基于Parseval框架的多小波子空间中的抽样定理.通过满足一定条件,给出抽样定理在多小波子空间中成立的等价条件.所得结果不仅推广了单小波子空间的抽样定理,而且抽样公式在L2(R)收敛意义下成立.     

高维半正交波包框架的刻画

研究了空间L²(Rⁿ)上半正交波包框架的存在性,刻画了空间L²(Rⁿ)上的半正交波包框架的特征,得到了多个小波函数组成的波包系构成波包巴塞尔框架的充分必要条件,以及波包框架成为半正交框架的等价条件.     

Sobolev空间Hs(R)上框架的充分条件

目的研究Sobolev空间H^s(R)上的框架。方法利用Plancherel定理和Cauchy—Schwarz不等式。结果讨论了Sobolev空间上小波框架和加窗Fourier变换框架的充分条件。结论将空间H^s(R)上有关框架的结果推广到Sobolev空间。     

以对角阵平移或调制的Gabor框架的充要条件

在L2(Rd)上通过把函数g和平移参数A或调制参数B特殊化的方法,推导以矩阵平移和调制的Gabor序列构成框架的条件,得到了L2(Rd)上当平移矩阵或调制矩阵是对角阵且生成函数的紧支集在一个特殊的区域内时候的Gabor 序列构成框架的两个充要条件.     

Hilbert空间上的近似斜对偶g-框架

本文在可分的Hilbert空间H中提出了近似斜对偶g-框架的定义，得到了Hilbert空间上近似斜对偶g-框架的一些性质和若干等价条件，并对近似斜对偶g-框架进行了一些刻画，且得到了近似斜对偶g-框架在构造过程中的一般形式.     

基于GMRA的Parseval框架小波

研究L2(Rd)中A伸缩的Parseval框架小波的性质,这里的A指的是行列式值取自然数的任意d×d阶扩展矩阵.首先,给出框架小波为半正交时的充要条件,然后证明Parseval框架小波为半正交的充要条件,得到所有基于广义多分辨分析(GMRA)的Parseval框架小波等价于闭子空间W0的Parseval框架为{TkΨ:k∈Zd}的条件.     

关于矩形平移的Helly数

证明了对于平面上由两两不交的矩形的平移形成的集簇，其Helly数等于5；对于R^d中由(d-2)-分离的超矩形的平移形成的集簇，其Helly数大于等于d 3，其中d≥3。     

一个面向知识的人—机接口模型

本文描述了一个将专家系统作为“智能前端处理器”(Intelligent Front-End),面向知识的人-机接口模型。IFE使用户不受源程序和数据的影响,把用户的请求转换为对源程序和数据的命令,允许用户以类自然语言作为输入,从而提高了与用户通讯的能力,促进了人-机之间的交互作用。     

ERDAS IMAGINE软件在森林资源调查中的应用——以巩留林场为例

文章叙述了以巩留林场为例,利用ERDA S软件对卫星影像数据进行精校正、融合、增强等处理,在建立解译标志的基础上采用人机对话的方式,对巩留林场森林资源进行调查的过程。     

一种数字程控交换实验系统的实现与分析

介绍一种数字程控交换实验系统的组成和原理 ,以及系统硬件和软件的实现 .以双音多频(DTMF)实验为例 ,根据相关函数编写了功能程序模块 ,并与主程序连接 ,进行编译和运行 ,使实验结果得以验证     

Peptide bond formation destabilizes Shine-Dalgarno interaction on the ribosome

The ribosome is a molecular machine that translates the genetic code contained in the messenger RNA into an amino acid sequence through repetitive cycles of transfer RNA selection, peptide bond formation and translocation. Here we demonstrate an optical tweezer assay to measure the rupture force between a single ribosome complex and mRNA. The rupture force was compared between ribosome complexes assembled on an mRNA with and without a strong Shine-Dalgarno (SD) sequence-a sequence found just upstream of the coding region of bacterial mRNAs, involved in translation initiation. The removal of the SD sequence significantly reduced the rupture force in complexes carrying an aminoacyl tRNA, Phe-tRNA(Phe), in the A site, indicating that the SD interactions contribute significantly to the stability of the ribosomal complex on the mRNA before peptide bond formation. In contrast, the presence of a peptidyl tRNA analogue, N-acetyl-Phe-tRNA(Phe), in the A site, which mimicked the post-peptidyl transfer state, weakened the rupture force as compared to the complex with Phe-tRNA(Phe), and the resultant force was the same for both the SD-containing and SD-deficient mRNAs. These results suggest that formation of the first peptide bond destabilizes the SD interaction, resulting in the weakening of the force with which the ribosome grips an mRNA. This might be an important requirement to facilitate movement of the ribosome along mRNA during the first translocation step.     

基于改进蚁群算法的车辆路径选择研究

给出了考虑软时间窗的物流配送车辆路径选择（VRP）模型,提出了一种改进的蚁群算法来求VRP模型的近似最优解。为了以最少的计算时间得出VRP问题的近似最优解,首先用贪婪算法产生初始蚁群,然后通过蚁群算法的评价、信息素释放、蚂蚁移动、信息素消散、判断收敛的循环过程对初始解进行优化。实践表明,在求解软时间窗物流配送车辆路径选择问题方面,改进蚁群算法具有更好的收敛性。该算法算法是求解VRP问题的较好方案。     

具温度边界条件的单相Stefan问题解的存在唯一性

证明了一种带有温度边界条件的Stefan问题解的存在唯一性.首先利用Green恒等式将问题转化为等价的积分方程组,由压缩映照原理得到了问题的局部解.再利用延拓方法得到了整体解.     

A reduced estimate of the number of kilometre-sized near-Earth asteroids

Near-Earth asteroids are small (diameters < 10 km), rocky bodies with orbits that approach that of the Earth (they come within 1.3 AU of the Sun). Most have a chance of approximately 0.5% of colliding with the Earth in the next million years. The total number of such bodies with diameters > 1 km has been estimated to be in the range 1,000-2,000, which translates to an approximately 1% chance of a catastrophic collision with the Earth in the next millennium. These numbers are, however, poorly constrained because of the limitations of previous searches using photographic plates. (One kilometre is below the size of a body whose impact on the Earth would produce global effects.) Here we report an analysis of our survey for near-Earth asteroids that uses improved detection technologies. We find that the total number of asteroids with diameters > 1 km is about half the earlier estimates. At the current rate of discovery of near-Earth asteroids, 90% will probably have been detected within the next 20 years.     

Model-based embedded compiled software fault positioning

Software fault positioning is one of the most effective activities in program debugging. In this paper, we propose a model-based fault positioning method to detect the faults of embedded program without source code. The system takes the machine code of embedded software as input and translates the code into high-level language C with the software reverse engineering program. Then, the static analysis on the high-level program is taken to obtain a control flow graph (CFG), which is denoted as a node-tree and each node is a basic block. According to the faults found by the field testing, we construct a fault model by extracting the features of the faulty code obtained by ranking the Ochiai coefficient of basic blocks. The model can be effectively used to locate the faults of the embedded program. Our method is evaluated on ST chips of the smart meter with the corresponding source code. The experiment shows that the proposed method has an effectiveness about 87% on the fault detection.     

联邦数据库系统嵌套查询的处理方法

本文介绍一种解决联邦数据库系统嵌套查询的处理方法：它将嵌套语句转化为一个不含嵌套的语句，或分解为一组子查询，嵌套留在本地库综合处理，这样使得不论成员库是否支持嵌套查询，它的关系总能被嵌套语句使用。