连通理论在英语一般过去时习得中的应用

一般过去时在英语语法中占有重要地位。连通理论认为语法的习得也是通过加强神经元的节点而习得的。随着语言输入的增加,网络的连接能力度也相应加强,语言形式和意义的关系便建立起来。连通理论不仅可以很好的解释一般过去时如何构建和习得的,而且对外语教学也有重要的借鉴作用。     

科技英语的特点及其翻译技巧

对科技英语句法上的一些主要特点进行了讨论，并结合这些特点，通过具体实例介绍了翻译技巧。     

一种带有流水线追踪器的JTAG ICE调试电路设计

针对复旦大学自主开发的32位RISCCPU,设计了相应JTAG调试电路(In—Circuit Emulator)。为解决此RISCCPU中5级流水线导致的断点误停的问题,提出了一种新颖的带有分支预测功能的电路结构一“流水线追踪器”。此JTAG调试电路与IEEE1149．1标准兼容,具有设置断点、单步、查看或修改CPU寄存器／内存空间、在线FLASH编程等多种功能。     

C语言调试方法探讨

从C语言调试的目的出发,介绍了C语言调试的一般方法和步骤,总结了调试中应遵循的几个原则,并创造性地对提出了“纸上调试”方法。     

Scannerless Boolean Parsing

Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing programming languages at the character level, disambiguation extensions beyond the usual context-free formalism are required.This paper explains how scannerless parsers for boolean grammars (context-free grammars extended with intersection and negation) can specify such languages unambiguously, and can also describe other interesting constructs such as indentation-based block structure.The sbp package implements this parsing technique and is publicly available as Java source code.     

Information Extraction from Web Pages Using Presentation Regularities and Domain Knowledge

World Wide Web is transforming itself into the largest information resource making the process of information extraction (IE) from Web an important and challenging problem. In this paper, we present an automated IE system that is domain independent and that can automatically transform a given Web page into a semi-structured hierarchical document using presentation regularities. The resulting documents are weakly annotated in the sense that they might contain many incorrect annotations and missing labels. We also describe how to improve the quality of weakly annotated data by using domain knowledge in terms of a statistical domain model. We demonstrate that such system can recover from ambiguities in the presentation and boost the overall accuracy of a base information extractor by up to 20%. Our experimental evaluations with TAP data, computer science department Web sites, and RoadRunner document sets indicate that our algorithms can scale up to very large data sets.     

From word to sentence: a pregroup analysis of the object pronoun <Emphasis Type="Italic">who</Emphasis>(<Emphasis Type="Italic">m</Emphasis>)

We explore a computational algebraic approach to grammar via pregroups, that is, partially ordered monoids in which each element has both a left and a right adjoint. Grammatical judgements are formed with the help of calculations on types. These are elements of the free pregroup generated by a partially ordered set of basic types, which are assigned to words, here of English. We concentrate on the object pronoun who(m).     

Structure and Properties of Traces for Functional Programs

The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support program comprehension and debugging. The trace was named the augmented redex trail. Its structure was inspired by standard graph rewriting implementations of functional languages. Here we describe a model of the trace that captures its essential properties and allows formal reasoning. The trace is a graph constructed by graph rewriting but goes beyond simple term graphs. Although the trace is a graph whose structure is independent of any rewriting strategy, we define the trace inductively, thus giving us a powerful method for proving its properties.