从AVS到MPEG-2的转码算法研究

介绍了视频转码的几种基本技术，分析了MPEG-2与AVS的不同，提出了一种从AVS到MPEG-2的转码系统．针对关键的转码算法设计了一种综合优化方案，实验显示图像质量和压缩率都有明显提高。     

基于人文关怀的信号配时方法研究

在传统的信号配时中，都是以减少车辆的总延误为目标，这样并不能很好地体现出整个社会中人的时间价值。现以减少所有通过交叉口的出行者的总延误为目标，在传统的信号配时方案的基础上，提出了一套新的配时方案，同时以减少全部出行者的总延误时间为目标给出了相应的延误评价公式，最后以杭州市文一路-古翠路口的实测交通数据进行分析，论证了本配时方案的有效性。     

立方相GaN的持续光电导

研究了金属有机物化学气相外延 (MOVPE)方法生长的非故意掺杂的立方相 Ga N的持续光电导效应 .在六方相 Ga N中普遍认为持续光电导效应与黄光发射有关 ,而实验则显示在立方 Ga N中 ,持续光电导效应与其中的六方相 Ga N夹杂有关系 ,而与黄光发射没有关系 .文中提出 ,立方相 Ga N与其中的六方相 Ga N夹杂之间的势垒引起的空间载流子分离是导致持续光电导现象的物理原因 .通过建立势垒限制复合模型 ,解释了立方相 Ga N的持续光电导现象的物理过程 ,并对光电导衰减过程的动力学作了分析 .对实验数据拟合的结果证明以上的模型和推导是与实验相符的 .     

含氮杂环季铵盐缓蚀剂在CO2-3%NaCl溶液体系中的电化学行为

为控制CO2腐蚀，合成了含氮杂环季铵盐缓蚀剂9912-1，通过电化学实验，研究了该缓蚀剂在CO2-3％NaCl-H2O体系中对碳钢于25℃和90℃下的缓蚀行为。实验结果与挂片失重法测试的结果基本一致。低温下缓蚀效果优于高温下的缓蚀效果。而且该缓蚀剂与硫脲有很好的协同效应。Tafel曲线表明，该缓蚀过程是以控制阴极腐蚀为主，并对其缓蚀机理进行了初步探讨。     

铜在高纯净钢中析出过程的观察

利用透射电子显微镜观察了铜在高纯净钢中的析出过程，发现早期析出阶段有类B2结构的亚稳相出现，分析了铜在高纯净钢中的析出贯序，研究结果对分析铜在高纯净钢中的时效强化机理具有重要意义。     

应用均匀设计法研究安息香缩合工艺

利用均匀设计法通过SPSS10.0计算机软件研究了反应条件对安息香缩合的影响。从而获得优化的工艺条件，与正交试验相比，该法试验次数少。工作效率高，并且便于分析各种因素的影响。     

深亚微米集成电路的快速时域仿真技术

随着深亚微米集成电路技术的发展，集成电路的规模越来越大，工作频率越来越高，并正朝着系统集成的方向发展，因而在模拟速度，模拟精度和可模拟的电路规模等各个方面对电路仿真技术提出了新的要求。近年来，各种新的电路仿真方法和仿真系统用相继脱颖百出，并将取代那些传统的，已经无法适应深亚微米技术发展的电路仿真器。     

Complex variable formulations for usual and hypersingular integral equations for potential problems — with applications to corners and cracks

This paper first presents an unified discussion of real and complex boundary integral equations (BIEs) for two-dimensional potential problems. Relationships between real and complex formulations, for both usual and hypersingular BIEs, are discussed. Potential problems in bounded as well as in unbounded domains are of concern in this work. Quantities of particular interest are derivatives of the primary field that exhibit discontinuities across corners, as well as stress intensity factors at the tips of mode III cracks. The latter problem in an application of a recent generalization of the well-known Plemelj-Sokhotsky formulae. Numerical implementations and results for interior problems in bounded domains, as well as for crack problems in unbounded domains, are presented and discussed.C. Y. Hui is supported by the Material Science Center at Cornell University, which is funded by the National Science Foundation (DMR-MRL program). S Mukherjee acknowledges partial support from NSF grant number ECS-9321508 to Cornell University.     

Minimal communication cost software construction in the Internet environment

This paper investigates the issue of building software in the Internet environment, where local area network (LAN) based systems are interconnected by links with different bandwidth and do not share file systems. The software is modeled as a directed acyclic graph. Each node in the graph represents a logical step in processing the software while the edges describe the order of execution. The problem is to construct the software at a particular LAN with minimum Internet communication cost. An optimal polynomial algorithm, SOFTCON, with time complexity is presented, where and are the number of nodes and edges in the graph describing the software respectively, is the number of LANs in the Internet environment, and is the time complexity of the network flow algorithm on the flow network with nodes and edges transformed from the directed acyclic graph of the software. Received: 6 December 1995 / 1 May 1996     

On solving constrained optimization problems with neural networks:a penalty method approach

Deals with the use of neural networks to solve linear and nonlinear programming problems. The dynamics of these networks are analyzed. In particular, the dynamics of the canonical nonlinear programming circuit are analyzed. The circuit is shown to be a gradient system that seeks to minimize an unconstrained energy function that can be viewed as a penalty method approximation of the original problem. Next, the implementations that correspond to the dynamical canonical nonlinear programming circuit are examined. It is shown that the energy function that the system seeks to minimize is different than that of the canonical circuit, due to the saturation limits of op-amps in the circuit. It is also noted that this difference can cause the circuit to converge to a different state than the dynamical canonical circuit. To remedy this problem, a new circuit implementation is proposed.