水轮机电液调速器人工失灵区的分析计算

本文对电液调速器的人工失灵区电路进行定量分析，导出了失灵区的一套计算公式，并指出失灵区与调差率、功率偏差的内在关系。     

一种新的抖动调制方法

本文在脉冲延迟发生的基础上提供了一种用调相方法实现抖动调制的方案。该采用数字电路，与传统的调频方法比较具有易实现，精度高等优点，并为进一步开发出抖动测试集资打下了基础。     

A region-based selective optical flow back-projection for genuine motion vector estimation

Motion vector plays one significant feature in moving object segmentation. However, the motion vector in this application is required to represent the actual motion displacement, rather than regions of visually significant similarity. In this paper, region-based selective optical flow back-projection (RSOFB) which back-projects optical flows in a region to restore the region's motion vector from gradient-based optical flows, is proposed to obtain genuine motion displacement. The back-projection is performed based on minimizing the projection mean square errors of the motion vector on gradient directions. As optical flows of various magnitudes and directions provide various degrees of reliability in the genuine motion restoration, the optical flows to be used in the RSOFB are optimally selected based on their sensitivity to noises and their tendency in causing motion estimation errors. In this paper a deterministic solution is also derived for performing the minimization and obtaining the genuine motion magnitude and motion direction.     

复杂山区静校正方法研究及效果

对于山区地震勘探，开展静校正研究是资料处理的主要问题之一。静校正精度与剖面质量密切相关，准确的静校正取决于合理的方法和正确的应用。本文在分析了复杂山区特点以及静校正难点的基础上，指出要解决好山区静校正，仅限于普通的方法是远远不够的，必须从四个关键点人手，即风化层延迟时的求取、基准面的确定、校正速度的研究以及表层模型的建立等。本文对上述问题的研究做了介绍，展示了合成延迟时法十等效速度模型反演十变速浮动基准面（地震参考面）静校正等综合技术在太行山区（山西沁源、大寨）、伊J；1丘陵山区等复杂地表区应用的例子。显著的处理效果表明，严重的山区静校正问题得到了较好的解决，满足了地下构造的叠加成像，提高了勘探精度及其整体效果。     

声表面波脉冲编码调制振荡器

论述了一种直接式声表面波脉冲编码调制振荡器的工作原理及设计方法。实际制作了工作频率为３９４ＭＨｚ、调制频偏大于２００ｋＨｚ、调制信号码速率大于４００ｋｂｉｔ／ｓ、输出功率大于５０ｍＷ、温度稳定性优于±５０×１０－６（－２０°Ｃ～＋６０°Ｃ）的性能优良的声表面波脉冲编码调制振荡器     

声表面波可程序抽头延迟线研究

报道声表面波可程序抽头延迟线的研制情况。对该器件的总体结构，电路原理框图、声表面波可程序抽头延迟线结构作了一个扼要的概念。同时分别报道了我所研制的各类声表面波可程序抽头延迟线器件性能指标及相应的图片说明，最后对该器件仍存在的一些问题作了探讨。     

离散效应存在时孤子脉冲的增强压缩

在群速度不匹配的条件下，提出一种提高孤子脉冲压缩效应的新方法．研究表明，若使信号脉冲与泵浦脉冲存在一适当的初始延时，则不但可以提高离散效应单独存在时信号脉冲的压缩比，而且可以提高孤子脉冲的压缩质量．     

层次网络中基于跳数区分的任意汇聚算法

从服务质量的实现来看,任意汇聚具有良好的延迟性能和扩展性,层次网络是有规则的网络拓扑,相比平面网络为任意汇聚的方法提供了更多的优势条件.通过建立任意汇聚的数学模型,分析了在层次网络体系结构中在一定的网络利用率条件下任意汇聚的最坏延迟约束,提出了一种基于跳数区分的任意汇聚调度算法.最后进行了实验分析,结果表明该方法能有效的改善任意汇聚的最坏延迟性能.     

基于波动方程的聚焦点控制照明叠前深度偏移

 基于波动方程的聚焦点控制照明叠前深度偏移技术借助于差分计算，把速度、密度等介质参数的影响体现在差分计算的矩阵方程中，能够自动适应速度场的任意变化，快速傅里叶变换的使用也加速了波场延拓的计算速度。因此此法兼具有限差分偏移方法和傅里叶偏移方法的优点，既可适应速度场的剧烈变化，又可保证对陡倾地层的成像效果，是目前针对复杂构造最有效的成像方法之一。对于单个聚焦点及其周围的成像步骤为：①采用矩形网格情况下绕射走时的有限差分计算方法生成合成算子；②应用合成算子来合成面炮震源和面波记录；③对合成的面炮震源和面波记录做傅里叶有限差分法波动方程叠前深度偏移，得到该聚焦点及其附近区域的成像结果。按照上述成像步骤，将震源波场和炮集记录依据相应的外推公式进行延拓，最终应用成像条件求取成像值。在地质目标处选取多个聚焦点，可以得到面向目标的控制照明偏移成像，在多个层位上选取多个聚焦点进行控制照明叠前深度偏移，可以得到整块区域的成像。通过对Marmousi模型的试算，取得了较好的效果。     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.