论中心信息等值原则在英汉习语互译中的应用

如何在英汉习语的互译中做到从形式到内容、从达意到传情、从语言到文化的成功转换是个难题。文章根据中心信息等值的原则 ,介绍了几种技巧 ,以寻求的语与源语之间表达效果的相同或相近     

文体翻译对等的量化评估

文体对等是翻译过程中所要求达到对等的一个层面。本文通过统计正负文体成分在语篇中的比值,来量化评估译文与原文在文体上是否对等,通过实例评估取得了较为满意的结果,为量化评估译文质量开辟了一条道路。     

新形势下农资价格大幅上涨对“三农”的影响分析

文章首先以湖北省襄樊市的调研数据为依据对此次农资价格整体变动情况作了说明，紧接着对本轮农资价格大幅上涨的深层次原因、趋势及其对“三农”的影响作了深入剖析。结果表明，农资生产原料价格的迅猛上涨是此次农资价格上涨的导火索与根本推动力量，农资上涨基本上冲销了中央一系列惠农政策带给农民的实惠，使农民的种粮积极性遭受很大挫伤。最后从放开价格、加强宏观调控、改变补贴方式、健全营销网络、完善储备制度、加强市场监管及监测等方面提出政策建议。     

英汉习语的文化翻译

由于文化背景的不同,英汉两种语言的习语文化内涵也有差异。该文先从思维方式、风俗习惯、宗教神话和地域环境四方面讨论了英汉习语文化内涵的不同,然后分析了引起习语翻译障碍的原因,依据等效翻译理论对习语翻译的方法作了简要探讨。     

论翻译再现的层次

翻译是一种双语行为。既要侧重于研究原语、解读原文文本,又要侧重于研究译语,在原文与译文文本表现法之间找到一个平衡点。表现法的目的是探讨如何将“获得的意义”落实到得体的目的语文本中。本文着重研究翻译表现法的基本原则,根据译者对意义把握和意义表达程度的深浅,翻译再现的层次可分为表层翻译、中介层翻译和深层翻译。     

试论戏剧翻译的标准

译文的使用目的决定了不同体裁文体的翻译应遵循不同的翻译标准。本文分析了戏剧翻译的特点,提出戏剧翻译应以功能对等为原则,以原语和译语观众能获得大体相同的反应为标准,并探讨了为达到功能对等需对译文进行调整。     

广告英语中双关语的翻译

双关语的可译性一直是翻译界争论的热点。语言、文化及表达习惯的差异,使双关语翻译难以兼顾其双重含义。"功能对等"理论以译语读者为中心,注重译文在译语语言和文化环境中所预期达到的功能,为双关语的翻译另辟蹊径。对英语广告中双关语的翻译来说,译文只要能产生与原文相似的广告效应,能使译文读者获得与原文读者近乎相同的感受就是成功的翻译。     

影视翻译初探

本文提出了影视翻译的重要性 ,呼吁翻译届对影视翻译的重视。作者概括了影视语言的五大特点和应遵循的原则与技巧。在坚持传统的“信 ,达 ,雅”翻译观的基础上 ,提出了影视翻译应以“达”(通顺 )为主 ,以译入语观众为目标的功能对等翻译论 ,以期为影视翻译提供一种新的理论视角和操作模式。     

A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

Abstract.  A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs (CGs), the Lauritzen–Wermuth–Frydenberg (LWF) and the Andersson–Madigan– Perlman (AMP) Markov properties, which are different in general but coincide for the subclass of CGs with no flags . Markov equivalence induces a partition of the class of CGs into equivalence classes and every equivalence class contains a, possibly empty, subclass of CGs with no flags itself containing a, possibly empty, subclass of directed acyclic graphs (DAGs). LWF-Markov equivalence classes of CGs can be naturally characterized by means of the so-called largest CGs , whereas a graphical characterization of equivalence classes of DAGs is provided by the essential graphs . In this paper, we show the existence of largest CGs with no flags that provide a natural characterization of equivalence classes of CGs of this kind, with respect to both the LWF- and the AMP-Markov properties. We propose a procedure for the construction of the largest CGs, the largest CGs with no flags and the essential graphs, thereby providing a unified approach to the problem. As by-products we obtain a characterization of graphs that are largest CGs with no flags and an alternative characterization of graphs which are largest CGs. Furthermore, a known characterization of the essential graphs is shown to be a special case of our more general framework. The three graphical characterizations have a common structure: they use two versions of a locally verifiable graphical rule. Moreover, in case of DAGs, an immediate comparison of three characterizing graphs is possible.     

An algorithmic approach to construct D-optimal saturated designs for logistic model

In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.