基于桥连接的词典学习方法的语义解析

现阶段的语义解析方法大部分都基于组合语义,这类方法的核心就是词典。词典是词汇的集合,词汇定义了自然语言句子中词语到知识库本体中谓词的映射。语义解析一直面临着词典中词汇覆盖度不够的问题。针对此问题,该文在现有工作的基础上,提出了基于桥连接的词典学习方法,该方法能够在训练中自动引入新的词汇并加以学习,为了进一步提高新学习到的词汇的准确度,该文设计了新的词语—二元谓词的特征模板,并使用基于投票机制的核心词典获取方法。该文在两个公开数据集(WebQuestions和Free917)上进行了对比实验,实验结果表明,该文方法能够学习到新的词汇,提高词汇的覆盖度,进而提升语义解析系统的性能,特别是召回率。     

带类型λ—演算

一、引言补演算是一个用函数描述计算的形式理论体系[1J,它由许多计算模型所组成。文〔1〕指出,应用认-演算比纯粹补演算更接近程序语言.但是由于内建函子和常数的引入常会发生一些问题,例如.常数O和函子+在机器中同样看待     

Breakdown characteristics of oil and paper insulation for a very fast transient voltage

This paper describes the dielectric breakdown characteristics of oil and oil‐impregnated paper for very fast transient (VFT) voltages. Blumlein circuits generate VFT voltages of 60 and 300 ns in a pulse width that simulates disconnecting switching surges in gas‐insulated switch gears. We measured the breakdown voltages of needle‐to‐plane, plane‐to‐plane oil gaps and several pieces of paper between plane electrodes for VFT and lightning impulse voltages. The measured data were formulated in V‐t characteristics and Weibull probability distributions. The inclination n of V‐t characteristics of insulating paper is 150, which is less than n = 13.7 of the plane‐to‐plane oil gap in the VFT time range. The shape parameters of Weibull distribution obtained in this study show that the scattering of breakdown voltages of paper is much less than that of oil. © 2002 Wiley Periodicals, Inc. Electr Eng Jpn, 141(4): 16–24, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10043     

微晶合金在电流互感器中的应用

从微晶合金的性能特点出发，分析了其在电流互感器中的应用前景。     

天津独流减河工程监控系统现地通信单元设计

提出一种配电网电容电流测量的新方法，在零序电压互感器的开口三角侧串联一个可调电感，通过注入一个变频恒流信号寻找配电网的谐振频率，改变可调电感的数值后寻找另一谐振频率，联立2个谐振方程求解电容电流，该方法消除了电压互感器漏抗对测量的影响。开发了配电网电容电流测量仪，经模拟试验和现场测试表明，该方法具有安全、快捷、准确等特点，适用于中性点不接地或经随调式消弧线圈接地配电网。     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

A process oriented semantics of the PRAM-language FORK

The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.

In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model.     

大型水轮发电机组励磁变压器参数及绝缘方式的选择--由三峡机组励磁系统投运引起的思考

结合三峡机组励磁系统的调试及投运经验,对大型水电机组静止自励系统选型中存在的一些关键性技术课题进行分析与论证,期望得出的结论有助于在大型水轮发电机组励磁系统参数选择和在提高机组运行安全、可靠性方面提供有益的借鉴。文中提出的励磁系统设计新理念仅代表个人的观点。     

变压器事故原因分析

通过分析一次变压器事故的原因。指出变压器实际运行中存在的问题。并结合自己的工作经验提出科学的改进建议。     

变压器有载合闸过程中故障分闸后铁心剩磁分析

通过有载合闸变压器模型,分析了变压器有载合闸过程中由于副边突然短路导致主保护动作时电流和磁通的暂态过程,并对变压器铁心内的剩磁作了定性的分析。