Dreamweaver UltraDev环境下实现数据库的动态链接

简要论述了如何在Dreamweaver UltraDev环境下实现对已有的Access或Excel数据库的动态链接的操作。在Dreamweaver UltraDev环境下，实现对企业、事业单位原有Access或Excel数据库的动态链接，可以在很短的时间内开发出符合单位实际情况的信息管理系统，并且可以使这类已经创建好的数据信息，不加任何修改地与外部进行交流，实现资源共享。将此系统以主页的形式链入Internet，可以实现开放式管理体系。     

结合小波变换与相位相关的图像匹配方法

图像匹配技术是图像测量系统中的关键技术,是目标定位中最基本的方法。相位相关作为一种图像匹配技术对噪声有较高的容忍程度,检测结果与照度无关,受几何失真影响小。但该方法对旋转变化非常敏感。为解决此问题,本文提出结合小波变换和相位相关的匹配算法,该算法首先对图像进行小波分解,并对结果中的近似信号进行空域旋转校正;然后利用相位相关方法进行图像匹配,从而达到快速精确的定位。该方法在掌纹图像匹配定位中的应用证明了它的有效性。     

VOD在有线电视网的实现

从视频点播系统的结构及组成和在有线电视网络中VOD系统的结构模式与应用两个方面，详细地阐述了如何利用有线电视网络实现视频点播，主要从以下3个方面介绍关于视频点播系统VOD技术：①视频点播VOD的技术原理；②视频点播系统的结构及组成；③有线电视视频点播系统的结构模式与应用。     

实用型多路输出直流稳压电源的设计与制作

本文介绍了一款可以输出±12V、±5V、3.3V多路电压的直流稳压电源,说明了该电源的设计方法、仿真效果和制作要点,并介绍了测试方法。为制作小型的多路输出直流稳压电源提供参考,也可用本文的方法制作可调输出电压的稳压电源。     

85℃3000小时系列焊片式铝电解电容器的开发研究

该次试验的目的是为了开发出85℃3000小时这种新的系列的焊片式铝电解电容器。为此,对该系列选取了最小电压200V的小容量和大容量,及最大电压450V的小容量和大容量的产品分别进行了设计和开发。开发过程中对阳极箔,阴极箔,电解纸,电解液等原材料进行了分析比较,并将四种设计分别做成产品并测试最薄弱的环节85℃3000小时的纹波电流试验,结果表明该系列的设计能很好地满足电性能要求。     

为调谐器设计的带自动幅度控制1.1GHz差分压控振荡器

为集成调谐器接收机芯片系统设计了一个带自动幅度控制回路的差分结构电容电感压控振荡器.通过采用pMOS管作为有源负阻使振荡器谐振回路可以直接接地电平,减小了寄生效应,扩大了频率调谐的线性及其范围.采用的自动幅度控制AAC回路具有元件少,噪声低,控制灵敏,调节容易,结构简单及设计方便的优点,并保证振荡器电路的性能最小地依赖于环境和制造工艺参数的变化.所设计的压控振荡器采用新加坡特许50GHz 0.35μm SiGe BiCMOS工艺流片,经测试在1MHz频率偏移处达到了-127.27dBc/Hz的相位噪声性能,具有宽的(990～1140MHz)和线性(调谐增益32.4MHz/V)的频率调谐曲线.整个振荡器电路在5V的供电电压下仅消耗6.6mA的电流,可以满足调谐器的应用需要.     

一种汉字报文的数值加密方法

针对汉字信息在公共信道传递的保密要求，研究了汉字在计算机内部的区位码表示形式，提出在信息加密中汉字对用区位码数值进行处理，研究设计了汉字区位码数值加密方式的一种方法，对加密的强度进行了简单分析，并给出了汉字的加密解密流程图和C语言的加密解密程序。     

宽带隙ZnMgO的电学特性及其透明薄膜场效应晶体管

首次提出了用六方相晶体结构的宽带隙ZnMgO作为薄膜场效应晶体管（TFT）的沟道层，用立方相ZnMgO纳米晶体薄膜作为栅绝缘层，在实验中用透明的ITO导电玻璃作为衬底，通过连续沉积六方和立方相结构的纳米ZnMgO晶体薄膜，并通过光刻、电极工艺等，研制了透明的ZnO基TFT, TFT的电流开关比达到1E4，场效应迁移率为0.6cm2/(V·s).在偏压2.5MV/cm下漏电流为1E-8A.     

Smooth functional and structural maps on the neocortex via orthonormal bases of the Laplace-Beltrami operator

Functional and structural maps, such as a curvature, cortical thickness, and functional magnetic resonance imaging (MRI) maps, indexed over the local coordinates of the cortical manifold play an important role in neuropsychiatric studies. Due to the highly convoluted nature of the cerebral cortex and image quality, these functions are generally uninterpretable without proper methods of association and smoothness onto the local coordinate system. In this paper, we generalized the spline smoothing problem (Wahba, 1990) from a sphere to any arbitrary two-dimensional (2-D) manifold with boundaries. We first seek a numerical solution to orthonormal basis functions of the Laplace-Beltrami (LB) operator with Neumann boundary conditions for a 2-D manifold M then solve the spline smoothing problem in a reproducing kernel Hilbert space (r.k.h.s.) of real-valued functions on manifold M with kernel constructed from the basis functions. The explicit discrete LB representation is derived using the finite element method calculated directly on the manifold coordinates so that finding discrete LB orthonormal basis functions is equivalent to solving an algebraic eigenvalue problem. And then smoothed functions in r.k.h.s can be represented as a linear combination of the basis functions. We demonstrate numerical solutions of spherical harmonics on a unit sphere and brain orthonormal basis functions on a planum temporale manifold. Then synthetic data is used to quantify the goodness of the smoothness compared with the ground truth and discuss how many basis functions should be incorporated in the smoothing. We present applications of our approach to smoothing sulcal mean curvature, cortical thickness, and functional statistical maps on submanifolds of the neocortex.     

Multi‐constrained Shortest Disjoint Paths for Reliable QoS Routing

Finding link‐disjoint or node‐disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi‐constrained link‐disjoint path pair problem. Based on this, we propose the link‐disjoint optimal multi‐constrained paths algorithm (LIDOMPA), to find the shortest link‐disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure‐aware non‐dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node‐disjoint optimal multi‐constrained paths algorithm (NODOMPA) for the multi‐constrained node‐disjoint path pair problem.