论林语堂对严复翻译观的发展

严复和林语堂是20世纪中国的著名翻译大家,他们为中国翻译理论奠定了基础.严复的"信、达、雅"是20世纪最有影响力的翻译理论.而林语堂则提出了"忠实、通顺、美"的标准.回顾、比较了两者的翻译观,论述林语堂对严复翻译理论的发展,旨在说明林语堂的翻译观对中同翻译理论的重大价值和贡献.     

从翻译目的论视角看高校网页中英文对照研究

各高校为了更好地宣传本校，推进高校国际化发展，在其中文网页的基础上对应增加了英文网页。本文以翻译目的论的原理为理论框架，参考译语文化中的平行文本，举例分析了我国一些重点大学网站英文版“学校概况”中存在的功能性、文化性以及语言性翻译失误的现象，并根据功能目的论翻译的策略进行实例分析，提出了如何遵循“翻译目的论”这个问题，并概括地说明了具体的实施方法。     

从“目的论”视角看旅游外宣品的汉英翻译

旅游业在中国的快速发展使得旅游外宣品的翻译显得越来越重要。"目的论"为旅游外宣品的翻译提供了一个新的视角。本文旨在通过对旅游外宣品材料的文本特征进行分析,探讨旅游外宣品英译的基本原则和翻译技巧。     

On the Expressiveness of Chi, Update, and Fusion calculi

Chi and Update calculi [9,17] have been independently introduced in order to model mobile systems. The two calculi are very close to each other and represent an evolution of π-calculus [15]. More recently a (non-straightforward) polyadic version of the Update calculus, the Fusion calculus, has been proposed [18].In the paper we give a fully abstract encoding from an asynchronous variant of Chi and Update calculi to asynchronous π-calculus [11,4]. This proves that, at least for their asynchronous variants, Chi and Update calculi are not more expressive than π-calculus. A similar result can be proved for the Fusion calculus.     

k-选择网和Pi演算的表达能力

文中定义了Petri网的一子类系列:k-选择网,它形成一个后类包含前类的Petri网子类的无穷序列,证明了此无穷序列的并集等于Petri网类,自由选择网是k=1的k-选择网,即1-选择网.在证明自由选择网系统可以用Pi演算表达的基础上,文中进一步证明了所有2-选择网系统可以用Pi演算表达.     

创造新视觉——“视觉艺术”与“科技”的对话

本文以新的角度,通过不同时期人类科技的发展来展示"视觉艺术"的演变,以及科技对"视觉艺术"的影响和两者之间的互动关系。     

CIDR与VLSM的比较

该文详细介绍了IPv4向IPv6过渡时期使用的两个重要技术:CIDR和VLSM。     

以因人制宜为本的“外训机械CAD”教学改革与实践

由于近年来对外交往的不断扩大,来我国军队院校进修学习的外军留学生数量随 之增加,培训要求也逐步提高,但是受训学员素质参差不齐的程度日趋严重。为了解决越来越 高的培训要求与受训个体差异日趋增加的矛盾,提出了因人制宜为本的教学理念,这一理念在 “外训机械CAD”课程教学改革实践应用中取得了良好的效果。     

On the Expressiveness of Probabilistic and Prioritized Data-retrieval in Linda

Linda tuple-spaces coordination model does not allow to express a preference of tuples. In many applications we could be interested in indicating tuples that should be returned more frequently w.r.t. other ones, or even tuples with a low relevance that should be taken under consideration only if there is no tuple with a higher importance. We present an extension of the tuple-space model with quantitative information that permit to express such forms of preference. More precisely, we consider tuples decorated with a quantitative label. Such labels will be considered with two different semantics, one modeling probabilistic distribution of data retrieval and the other modeling priorities of tuples. Finally, we report all the results concerning the expressiveness gap between the standard model and the proposed extensions. We show that by adding probabilities the leader election problem can be solved. More surprisingly, the addition of priorities makes the model Turing complete, while we prove that this is not the case for the other two calculi.     

Expressiveness and the completeness of Hoare's logic

Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correctness of while-programs equipped with a first-order assertion language. The results are about the expressiveness of the assertion language and the role of specifications in completeness concerns for the logic: (1) expressiveness is not a necessary condition on a structure for its Hoare logic to be complete, (2) complete number theory is the only extension of Peano Arithmetic which yields a logically complete Hoare logic and (3) a computable structure with enumeration is expressive if and only if its Hoare logic is complete.     

Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states

Storing and retrieving time-related information are important, or even critical, tasks on many areas of computer science (CS) and in particular for artificial intelligence (AI). The expressive power of temporal databases/query languages has been studied from different perspectives, but the kind of temporal information they are able to store and retrieve is not always conveniently addressed. Here we assess a number of temporal query languages with respect to the modelling of time intervals, interval relationships and states, which can be thought of as the building blocks to represent and reason about a large and important class of historic information. To survey the facilities and issues which are particular to certain temporal query languages not only gives an idea about how useful they can be in particular contexts, but also gives an interesting insight in how these issues are, in many cases, ultimately inherent to the database paradigm. While in the area of AI declarative languages are usually the preferred choice, other areas of CS heavily rely on the extended relational paradigm. This paper, then, will be concerned with the representation of historic information in two well known temporal query languages: Templog in the context of temporal deductive databases, and TSQL2 in the context of temporal relational databases. We hope the results highlighted here will increase cross-fertilisation between different communities. This article can be related to recent publications drawing the attention towards the different approaches followed by the Databases and AI communities when using time-related concepts.     

论《图形创意》课程的教育原则

在实施《图形创意》课程的教学过程中,除遵守和贯彻教育学的一般原则外,还要遵守与艺术教育的目的和特点相关联的领悟性原则。本文从形象思维的角度探讨了"知觉促动"(领悟)的原理,并尝试解决《图形创意》课程的学习方法和领悟境界。     

A Comparison between SAT and CSP Techniques

The aim of this paper is to establish a connection between the propositional logic and the constraint based reasoning frameworks. This work is based on a translation of the satisfiability problem (SAT) into the binary constraint-satisfaction problem (CSP). The structure of the SAT problem and its associated CSP are then exploited together for characterizing tractable SAT problems, increasing the effectiveness of the classical reduction rules: unit clause and monotone literal rules, and expressing the arc and path consistency concepts with logical inference rules. This study leads to compare the behaviors of the DP and MAC procedures for solving respectively a SAT instance and its binary CSP expression.