外文翻译模板2010

合集下载

本科毕业论文外文翻译【范本模板】

本科毕业论文外文翻译外文译文题目:不确定条件下生产线平衡：鲁棒优化模型和最优解解法学院：机械自动化专业：工业工程学号: 201003166045学生姓名: 宋倩指导教师：潘莉日期: 二○一四年五月Assembly line balancing under uncertainty: Robust optimization modelsand exact solution methodÖncü Hazır , Alexandre DolguiComputers ＆Industrial Engineering，2013,65：261–267不确定条件下生产线平衡：鲁棒优化模型和最优解解法安库·汉泽，亚历山大·多桂计算机与工业工程，2013，65：261–267摘要这项研究涉及在不确定条件下的生产线平衡，并提出两个鲁棒优化模型。

假设了不确定性区间运行的时间。

该方法提出了生成线设计方法,使其免受混乱的破坏。

基于分解的算法开发出来并与增强策略结合起来解决大规模优化实例.该算法的效率已被测试,实验结果也已经发表。

本文的理论贡献在于文中提出的模型和基于分解的精确算法的开发.另外，基于我们的算法设计出的基于不确定性整合的生产线的产出率会更高，因此也更具有实际意义。

此外,这是一个在装配线平衡问题上的开创性工作,并应该作为一个决策支持系统的基础。

关键字：装配线平衡；不确定性; 鲁棒优化；组合优化；精确算法1.简介装配线就是包括一系列在车间中进行连续操作的生产系统。

零部件依次向下移动直到完工。

它们通常被使用在高效地生产大量地标准件的工业行业之中。

在这方面，建模和解决生产线平衡问题也鉴于工业对于效率的追求变得日益重要。

生产线平衡处理的是分配作业到工作站来优化一些预定义的目标函数。

那些定义操作顺序的优先关系都是要被考虑的,同时也要对能力或基于成本的目标函数进行优化。

就生产（绍尔，1999）产品型号的数量来说，装配线可分为三类：单一模型（SALBP）,混合模型(MALBP）和多模式（MMALBP）。

外文翻译参考格式-副本.doc2

学号： 09436230常州大学毕业设计〔论文〕外文翻译〔2009届〕外文题目译文题目外文出处学生学院机械工程学院专业班级材料成型与控制工程092 校内指导教师李晓艳专业技术职务讲师校外指导教师〔宋体四号粗体〕专业技术职务〔宋体四号粗体〕二○一三年二月关于在动力学热处理系统下注射成型过程中的显微结构制模质量的研究Sascha Kuhn • August Burr • Michael Ku¨bler •Matthias Deckert •Christoph BleesenReceived: 15 January 2010 / Accepted: 17 May 2010 / Published online: 30May 2010 Springer-Verlag 2010摘要：注射模具的显微结构是一种具有开展前景的生产方法，这种方法适用于广泛材料的大规模生产。

然而值得注意的是，这些结构重复生产的质量依赖于灌浆阶段的热流动。

这篇论文中，5微米以下的骨架型和其他结构的注射以与加热的转移是在AFM 〔原子显微力〕和热理论的根底上研究所得。

一种数字模型得以研发，这种模型用来预测在注射填料阶段外表结构的填充。

这种模型的使用，暗示着完全开展的流动理论模型已经将幂律材料模型纳入考虑之中。

这就允许研究深入到另一个层面，这个层面是关于加工过程中的参数是通过那些途径来影响聚合物在外表结构上的流动。

模具壁的温度，显著的影响了聚合物的流动。

通过使用一种电子热模型温度控制系统来改变模具壁的温度，使得这种关于这种模型的建议有效。

1 介绍热塑性材料的注射成型，在很多不同领域，低本钱部件的生产中是很普遍的。

近年来，含有显微结构的聚合物部件的生产呈现出增长的态势。

具有高复杂度的微型流动设备，能够大规模的生产，并且具有高精度和再生性，这种设备广泛运用于，例如医疗，化学，生物等。

未来官能度在外表和X围的包含物不仅仅是流体系统的一项关键性技术，也是许多微型系统的技术和其他消费产品的普遍应用。

毕业论文外文翻译格式【范本模板】

因为学校对毕业论文中的外文翻译并无规定，为统一起见,特做以下要求：1、每篇字数为1500字左右，共两篇；2、每篇由两部分组成:译文+原文.3 附件中是一篇范本，具体字号、字体已标注。

外文翻译（包含原文)(宋体四号加粗）外文翻译一（宋体四号加粗）作者：(宋体小四号加粗）Kim Mee Hyun Director, Policy Research & Development Team，Korean Film Council（小四号）出处：(宋体小四号加粗)Korean Cinema from Origins to Renaissance(P358～P340) 韩国电影的发展及前景（标题：宋体四号加粗）1996～现在数量上的增长(正文:宋体小四）在过去的十年间，韩国电影经历了难以置信的增长。

上个世纪60年代，韩国电影迅速崛起，然而很快便陷入停滞状态,直到90年代以后，韩国电影又重新进入繁盛时期。

在这个时期，韩国电影在数量上并没有大幅的增长，但多部电影的观影人数达到了上千万人次。

1996年，韩国本土电影的市场占有量只有23.1%。

但是到了1998年，市场占有量增长到35。

8%，到2001年更是达到了50%。

虽然从1996年开始，韩国电影一直处在不断上升的过程中，但是直到1999年姜帝圭导演的《生死谍变》的成功才诞生了韩国电影的又一个高峰。

虽然《生死谍变》创造了韩国电影史上的最高电影票房纪录，但是1999年以后最高票房纪录几乎每年都会被刷新。

当人们都在津津乐道所谓的“韩国大片”时，2000年朴赞郁导演的《共同警备区JSA》和2001年郭暻泽导演的《朋友》均成功刷新了韩国电影最高票房纪录.2003年康佑硕导演的《实尾岛》和2004年姜帝圭导演的又一部力作《太极旗飘扬》开创了观影人数上千万人次的时代。

姜帝圭和康佑硕导演在韩国电影票房史上扮演了十分重要的角色。

从1993年的《特警冤家》到2003年的《实尾岛》，康佑硕导演了多部成功的电影。

(范例)外文翻译格式

本科毕业设计（论文）外文翻译译文学生姓名：院（系）：经济管理学院专业班级：市场营销0301班指导教师：完成日期：2007年3 月22 日日本的分销渠道——对于进入日本市场的挑战与机会Distribution Channels in JapanChallenges and Opportunities for theJapanese Market Entry作者：Hokey Min起止页码：P22-35出版日期（期刊号）：0960-0035出版单位：MCB Univercity Press外文翻译译文：介绍尽管美国对日本的出口在过去两年已有大幅度的增长，然而美国对日本仍然存在着很大的贸易赤字。

尽管没有出现下降趋势，但越来越多的美国决策者及商务经理已经开始审查日本的贸易活动。

在这些人中，有一个很普遍的想法就是日本市场没有对美国产品开放，相反，美国市场对日本的贸易是开放的。

因此，克林顿政府试图采取强硬措施来反对日本的一系列贸易活动，包括商业习惯和政府政策，还企图通过贸易制裁的威胁来反对日本产品。

然而，这样的措施也会产生适得其反的结果。

它不仅会为美国消费者带来更高的商品价格和更少的商品选择，同时也会增加日本消费者的反美情绪。

最近Ginkota和Kotabe的调查表明：单独的贸易谈判不会提高美国商品进入日本市场的能力。

而对于提高美国公司进入日本市场能力的一个行之有效的方法就是研究日本近几个世纪以来所采用的商业活动。

由于法律障碍或者是日本公司对外封锁商业渠道，日本当地的分销渠道往往对外国公司不利，而这样的商业活动被认为是进入日本市场的主要障碍。

事实上，Yamawaki美国商品成功出口到日本市场在很大程度上取决于美国解决协议合同的能力。

尽管进入日本市场意义重大，然而对西方人而言，日本的经销体系经常会被人误以为是充满神秘感的。

这种误解源于日本复杂的分销惯例特征。

而这种分销惯例沿袭古老的而又严谨的建设体系。

在尝试美国贸易在日本市场成功获利减少不必要的贸易冲突过程中，我们揭露了日本分销中获利的事实，探索出了能成功进入日本市场的战略性武器。

翻译格式模板

外文翻译（译文字数不少于2000字）齿叶夜睡莲对曼扎拉湖(尼罗河三角洲)周边栽培的水稻的生长及产量的化感作用*学生：×××指导老师：×××摘要：（黑体，小四）在埃及曼扎拉湖周边新开垦的与外界阻隔的湖田中，莲属侵入稻田是导致农作物破坏和谷粒产量下降的一个主要原因。

本研究针对齿叶夜睡莲对水稻的化感作用提出了深刻的见解(Oryza sativa cavr. Giza-177)。

莲根状茎的提取液对水稻种子萌发和幼苗的生长具有抑制作用。

抑制的程度主要是受提取液的类型和浓度的影响。

其中乙醇提取液和水提取液的抑制作用要比氯仿提取液的抑制作用强。

乙醇提取液中的酚醛含量显示了它的最大的抑制作用。

在一个目标作物（水稻）和它的近邻（莲）的盆载实验中，大米的干重和相对生长率受种子年龄和莲根状茎密度的影响，生长率随着莲密度的增大而降低。

对一个生长了莲和未生长莲的稻田中的数据处理证明了生长莲的稻田中水稻的叶面积指数和产量均降低。

通过气相色谱法或质谱分析法识别潜在的化感化合物显示了莲根状茎中存在化感化合物酚醛。

（宋体，小四）关键词：（黑体，小四）莲提取液，酚醛，萌发，幼苗，生长，叶面积指数，谷粒产量，水稻，埃及（宋体，小四）引言(大标题，黑体，四号)在过去的几十年里，尼罗河上大规模面积的湿地都因为各种各样的发展目的而被开垦。

曼扎拉湖的大部分面积也被开垦，并且倾向于当作农田使用。

因为高水位和水稻土，水稻是新开垦区域种植的主要农作物。

很多农田中都有记录大米的产量严重降低。

但是明显的全年的栽培大米和苜蓿并相互更替并不是导致大米产量严重降低的主要原因，其中还包括很多其它因素，但是它们的重要性*原文：Ahmad K. Hegazy, W. M.Amer, A. A. Khedr. Allelopathic effect of Nymphaea lotus L. on growth and yield of cultivated rice around Lake Manzala (Nile Delta). Hydrobiologia, 2001,464: 133–142.还没有完全理解；比如，差的排水系统和部分稻子的不可收割。

附表：外文翻译格式

英文翻译(原文)说明书题目：系别：专业：学生姓名：学号：指导教师：职称：题目类型：理论研究实验研究工程设计工程技术研究软件开发年月日英文翻译(译文)说明书题目：系别：专业：学生姓名：学号：指导教师：职称：题目类型：理论研究实验研究工程设计工程技术研究软件开发年月日附件二：范例摘要(“摘要”之间空两格，采用三号字、黑体、居中，与内容空一行) （内容采用小四号宋体）注：毕业设计（论文）摘要或总说明书要概括研究课题的内容、方法和观点以及取得的成果和结论，应反映整个内容的精华，字数在300字左右。

关键词：(小四号、黑体、顶格)☆☆☆；☆☆☆；☆☆☆（内容采用小四号、宋体、接排、各关键词之间有分号）Abstract（三号加粗）：(采用三号字、Times New Roman字体、加黑、居中、与内容空一行) There is a kind of automatic access system that use automatic indemnification technology to identify user’s ID and rights, and according to user’s rights to control the door.••••••（内容采用小四号Times New Roman字体，要求300-500单词）Key words（小四号加粗、Times New Roman字体、顶格）：（内容采用小四号、Times New Roman字体、接排、各关键词之间有分号）目录（三号、黑体、居中、目录两字空四格、与正文空一行）引言 (1)1（空两格）☆☆☆☆，☆☆（四号黑体） (3)1.1（空一格）☆☆☆，☆☆☆（小四号黑体） (3)1.2 ☆☆☆、☆☆☆☆ (4)2 ☆☆☆☆☆☆☆☆ (6)2.1 ☆☆☆、☆☆，☆ (6)2.1.1☆☆☆☆☆ (6)2.1.2☆☆☆☆☆☆ (7)••••••5 结论 (34)谢辞 (35)参考文献 (35)附录 (36)注：目录按三级标题编写（即：1 ……、1.1 ……、1.1.1 ……），要求标题层次清晰。

外文译文模板

毕业论文（设计）外文译文题目外商直接投资与投资环境学院经济学院专业经济学年级2010级学生姓名彭雅娟学号*********指导教师李宏伟外商直接投资与投资环境Nihal BayraktarProcedia Economics and Finance 5 (2013) 83 – 92【摘要】外国直接投资(FDI)从发达国家向发展中国家转移，特别是在金融危机之后，引起了更多专家的关注。

在本文中，外商直接投资和“经商容易度”指标之间的联系，被视为外国直接投资方向变化的一个可能因素，本文对此进行了研究。

数据来源是世界银行的营商环境数据库。

这项研究的时间跨度从2004年至2010年，由于本文涵盖了全球金融危机前几年的经济状况，以及在危机时期，外国直接投资的变化方向可以更好地评估对发展中国家“经商容易度”的影响。

初步的研究结果表明，那些在“做生意”时有好记录的国家往往会吸引更多的外国直接投资。

发展中国家“经商容易度”指标的提高,在决定更高的外国直接投资流入这些国家可以有部分解释权。

【关键词】外商直接投资全球营商环境指标发展中国家投资环境1 引言外国直接投资(FDI)，尤其是流入，一直被视为技术外溢，提高效率和经济增长的重要来源。

因此，外国直接投资已经被作了广泛研究。

不同的因素被列为外商直接投资的决定因素如受援国的劳动力成本，人力资本水平，再投资，贸易开放程度，金融开放，国家的规模，自然资源禀赋，宏观经济和政治因素，税收，以及投资环境。

外商直接投资的变化方向从发达国家向发展中国家，特别是在危机之后，已经开始吸引更多的关注。

在本文中，外国直接投资和“经商容易度”之间的联系，作为外国直接投资的变化方向的一种可能来源进行了研究。

数据来源是世界银行的营商环境数据库。

这项研究涵盖了从2004年至2011年，由于本文包括几年的经济和金融全球危机前的经济，以及在危机时期，外国直接投资的变化可以更好地评估对发展中国家“经商容易度”的影响。

毕业设计(论文)外文资料和译文格式要求

东北大学东软信息学院外文资料和译文格式要求一、译文必须采用计算机输入、打印，幅面A4。

外文资料原文（复印或打印）在前，译文在后，于左侧装订。

二、具体要求1、至少翻译一篇内容与所选课题相关的外文文献。

2、译文汉字字数不少于4000字。

3、正文格式要求：宋体五号字。

附：外文资料和译文封面、空白页外文资料和译文专业：班级：姓名：学号：指导教师：2010年12月23日5.2.5. Read/Write Spin LocksRead/write spin locks have been introduced to increase the amount of concurrency inside the kernel. They allow several kernel control paths to simultaneously read the same data structure, as long as no kernel control path modifies it. If a kernel control path wishes to write to the structure, it must acquire the write version of the read/write lock, which grants exclusive access to the resource. Of course, allowing concurrent reads on data structures improves system performance.Figure 5-2 illustrates two critical regions (C1 and C2) protected by read/write locks. Kernel control paths R0 and R1 are reading the data structures in C1 at the same time, while W0 is waiting to acquire the lock for writing. Kernel control path W1 is writing the data structures inC2, while both R2 and W2 are waiting to acquire the lock for reading and writing, respectively.Figure 5-2. Read/write spin locksEach read/write spin lock is a rwlock_t structure; its lock field is a 32-bit field that encodes two distinct pieces of information:∙ A 24-bit counter denoting the number of kernel control paths currently reading the protected data structure. The two's complement value of this counter is stored in bits 023 of the field.∙An unlock flag that is set when no kernel control path is reading or writing, and clear otherwise. This unlock flag is stored in bit 24 of the field.Notice that the lock field stores the number 0x01000000 if the spin lock is idle (unlock flag set and no readers), the number 0x00000000 if it has been acquired for writing (unlock flag clear and no readers), and any number in the sequence 0x00ffffff, 0x00fffffe, and so on, if it has been acquired for reading by one, two, or more processes (unlock flag clear and the two's complement on 24 bits of the number of readers). As the spinlock_t structure, the rwlock_t structure also includes a break_lock field.The rwlock_init macro initializes the lock field of a read/write spin lock to 0x01000000 (unlocked) and the break_lock field to zero.5.2.5.1. Getting and releasing a lock for readingThe read_lock macro, applied to the address rwlp of a read/write spin lock, is similar to thespin_lock macro described in the previous section. If the kernel preemption option has been selected when the kernel was compiled, the macro performs the very same actions as those of spin_lock( ), with just one exception: to effectively acquire the read/write spin lock in step 2, the macro executes the _raw_read_trylock( ) function:int _raw_read_trylock(rwlock_t *lock){atomic_t *count = (atomic_t *)lock->lock;atomic_dec(count);if (atomic_read(count) >= 0)return 1;atomic_inc(count);return 0;}The lock fieldthe read/write lock counteris accessed by means of atomic operations. Notice, however, that the whole function does not act atomically on the counter: for instance, the counter might change after having tested its value with the if statement and before returning 1. Nevertheless, the function works properly: in fact, the function returns 1 only if the counter was not zero or negative before the decrement, because the counter is equal to 0x01000000 for no owner, 0x00ffffff for one reader, and 0x00000000 for one writer.If the kernel preemption option has not been selected when the kernel was compiled, theread_lock macro yields the following assembly language code:movl $rwlp->lock,%eaxlock; subl $1,(%eax)jns 1fcall _ _read_lock_failed1:where _ _read_lock_failed( ) is the following assembly language function:_ _read_lock_failed:lock; incl (%eax)1: pausecmpl $1,(%eax)js 1block; decl (%eax)js _ _read_lock_failedretThe read_lock macro atomically decreases the spin lock value by 1, thus increasing the number of readers. The spin lock is acquired if the decrement operation yields a nonnegative value; otherwise, the _ _read_lock_failed( ) function is invoked. The function atomically increases the lock field to undo the decrement operation performed by the read_lock macro, and then loops until the field becomes positive (greater than or equal to 1). Next, _ _read_lock_failed( ) tries to get the spin lock again (another kernel control path could acquire the spin lock for writing right after the cmpl instruction).Releasing the read lock is quite simple, because the read_unlock macro must simply increase the counter in the lock field with the assembly language instruction:lock; incl rwlp->lockto decrease the number of readers, and then invoke preempt_enable( ) to reenable kernel preemption.5.2.5.2. Getting and releasing a lock for writingThe write_lock macro is implemented in the same way as spin_lock( ) andread_lock( ). For instance, if kernel preemption is supported, the function disables kernel preemption and tries to grab the lock right away by invoking_raw_write_trylock( ). If this function returns 0, the lock was already taken, thus the macro reenables kernel preemption and starts a busy wait loop, as explained in the description of spin_lock( ) in the previous section.The _raw_write_trylock( ) function is shown below:int _raw_write_trylock(rwlock_t *lock){atomic_t *count = (atomic_t *)lock->lock;if (atomic_sub_and_test(0x01000000, count))return 1;atomic_add(0x01000000, count);return 0;}The _raw_write_trylock( ) function subtracts 0x01000000 from the read/write spin lock value, thus clearing the unlock flag (bit 24). If the subtraction operation yieldszero (no readers), the lock is acquired and the function returns 1; otherwise, the function atomically adds 0x01000000 to the spin lock value to undo the subtraction operation.Once again, releasing the write lock is much simpler because the write_unlock macro must simply set the unlock flag in the lock field with the assembly language instruction:lock; addl $0x01000000,rwlpand then invoke preempt_enable().5.2.6. SeqlocksWhen using read/write spin locks, requests issued by kernel control paths to perform a read_lock or a write_lock operation have the same priority: readers must wait until the writer has finished and, similarly, a writer must wait until all readers have finished.Seqlocks introduced in Linux 2.6 are similar to read/write spin locks, except that they give a much higher priority to writers: in fact a writer is allowed to proceed even when readers are active. The good part of this strategy is that a writer never waits (unless another writer is active); the bad part is that a reader may sometimes be forced to read the same data several times until it gets a valid copy.Each seqlock is a seqlock_t structure consisting of two fields: a lock field of type spinlock_t and an integer sequence field. This second field plays the role of a sequence counter. Each reader must read this sequence counter twice, before and after reading the data, and check whether the two values coincide. In the opposite case, a new writer has become active and has increased the sequence counter, thus implicitly telling the reader that the data just read is not valid.A seqlock_t variable is initialized to "unlocked" either by assigning to it the value SEQLOCK_UNLOCKED, or by executing the seqlock_init macro. Writers acquire and release a seqlock by invoking write_seqlock( ) and write_sequnlock( ). The first function acquires the spin lock in the seqlock_t data structure, then increases the sequence counter by one; the second function increases the sequence counter once more, then releases the spin lock. This ensures that when the writer is in the middle of writing, the counter is odd, and that when no writer is altering data, the counter is even. Readers implement a critical region as follows:unsigned int seq;do {seq = read_seqbegin(&seqlock);/* ... CRITICAL REGION ... */} while (read_seqretry(&seqlock, seq));read_seqbegin() returns the current sequence number of the seqlock; read_seqretry() returns 1 if either the value of the seq local variable is odd (a writer was updating the data structure when the read_seqbegin( ) function has been invoked), or if the value of seq does not match the current value of the seqlock's sequence counter (a writer started working while the reader was still executing the code in the critical region).Notice that when a reader enters a critical region, it does not need to disable kernel preemption; on the other hand, the writer automatically disables kernel preemption when entering the critical region, because it acquires the spin lock.Not every kind of data structure can be protected by a seqlock. As a general rule, the following conditions must hold:∙The data structure to be protected does not include pointers that are modified by the writers and dereferenced by the readers (otherwise, a writer couldchange the pointer under the nose of the readers)∙The code in the critical regions of the readers does not have side effects (otherwise, multiple reads would have different effects from a single read) Furthermore, the critical regions of the readers should be short and writers should seldom acquire the seqlock, otherwise repeated read accesses would cause a severe overhead. A typical usage of seqlocks in Linux 2.6 consists of protecting some data structures related to the system time handling (see Chapter 6).5.2.7. Read-Copy Update (RCU)Read-copy update (RCU) is yet another synchronization technique designed to protect data structures that are mostly accessed for reading by several CPUs. RCU allows many readers and many writers to proceed concurrently (an improvement over seqlocks, which allow only one writer to proceed). Moreover, RCU is lock-free, that is, it uses no lock or counter shared by all CPUs; this is a great advantage over read/write spin locks and seqlocks, which have a high overhead due to cache line-snooping and invalidation.How does RCU obtain the surprising result of synchronizing several CPUs without shared data structures? The key idea consists of limiting the scope of RCU as follows:1.Only data structures that are dynamically allocated and referenced by meansof pointers can be protected by RCU.2.No kernel control path can sleep inside a critical region protected by RCU.When a kernel control path wants to read an RCU-protected data structure, it executes the rcu_read_lock( ) macro, which is equivalent to preempt_disable( ). Next, the reader dereferences the pointer to the data structure and starts reading it. As stated above, the reader cannot sleep until it finishes reading the data structure; the end of the critical region is marked by the rcu_read_unlock( ) macro, which is equivalent to preempt_enable( ).Because the reader does very little to prevent race conditions, we could expect that the writer has to work a bit more. In fact, when a writer wants to update the data structure, it dereferences the pointer and makes a copy of the whole data structure. Next, the writer modifies the copy. Once finished, the writer changes the pointer to the data structure so as to make it point to the updated copy. Because changing the value of the pointer is an atomic operation, each reader or writer sees either the old copy or the new one: no corruption in the data structure may occur. However, a memory barrier is required to ensure that the updated pointer is seen by the other CPUs only after the data structure has been modified. Such a memory barrier is implicitly introduced if a spin lock is coupled with RCU to forbid the concurrent execution of writers.The real problem with the RCU technique, however, is that the old copy of the data structure cannot be freed right away when the writer updates the pointer. In fact, the readers that were accessing the data structure when the writer started its update could still be reading the old copy. The old copy can be freed only after all (potential) readers on the CPUs have executed the rcu_read_unlock( ) macro. The kernel requires every potential reader to execute that macro before:∙The CPU performs a process switch (see restriction 2 earlier).∙The CPU starts executing in User Mode.∙The CPU executes the idle loop (see the section "Kernel Threads" in Chapter 3).In each of these cases, we say that the CPU has gone through a quiescent state.The call_rcu( ) function is invoked by the writer to get rid of the old copy of the data structure. It receives as its parameters the address of an rcu_head descriptor (usually embedded inside the data structure to be freed) and the address of a callback function to be invoked when all CPUs have gone through a quiescent state. Once executed, the callback function usually frees the old copy of the data structure.The call_rcu( ) function stores in the rcu_head descriptor the address of the callback and its parameter, then inserts the descriptor in a per-CPU list of callbacks. Periodically, once every tick (see the section "Updating Local CPU Statistics" in Chapter 6), the kernel checks whether the local CPU has gone through a quiescent state. When all CPUs have gone through a quiescent state, a local taskletwhose descriptor is stored in the rcu_tasklet per-CPU variableexecutes all callbacks in the list.RCU is a new addition in Linux 2.6; it is used in the networking layer and in the Virtual Filesystem.5.2.8. SemaphoresWe have already introduced semaphores in the section "Synchronization and Critical Regions" in Chapter 1. Essentially, they implement a locking primitive that allows waiters to sleep until the desired resource becomes free.Actually, Linux offers two kinds of semaphores:∙Kernel semaphores, which are used by kernel control paths∙System V IPC semaphores, which are used by User Mode processesIn this section, we focus on kernel semaphores, while IPC semaphores are described in Chapter 19.A kernel semaphore is similar to a spin lock, in that it doesn't allow a kernel control path to proceed unless the lock is open. However, whenever a kernel control path tries to acquire a busy resource protected by a kernel semaphore, the corresponding process is suspended. It becomes runnable again when the resource is released. Therefore, kernel semaphores can be acquired only by functions that are allowed to sleep; interrupt handlers and deferrable functions cannot use them.A kernel semaphore is an object of type struct semaphore, containing the fields shown in the following list.countStores an atomic_t value. If it is greater than 0, the resource is free that is, itis currently available. If count is equal to 0, the semaphore is busy but noother process is waiting for the protected resource. Finally, if count isnegative, the resource is unavailable and at least one process is waiting for it.waitStores the address of a wait queue list that includes all sleeping processes that are currently waiting for the resource. Of course, if count is greater than orequal to 0, the wait queue is empty.sleepersStores a flag that indicates whether some processes are sleeping on thesemaphore. We'll see this field in operation soon.The init_MUTEX( ) and init_MUTEX_LOCKED( ) functions may be used to initialize a semaphore for exclusive access: they set the count field to 1 (free resource with exclusive access) and 0 (busy resource with exclusive access currently granted to the process that initializes the semaphore), respectively. The DECLARE_MUTEX and DECLARE_MUTEX_LOCKED macros do the same, but they also statically allocate the struct semaphore variable. Note that a semaphore could also be initialized with an arbitrary positive value n for count. In this case, at most n processes are allowed to concurrently access the resource.5.2.8.1. Getting and releasing semaphoresLet's start by discussing how to release a semaphore, which is much simpler than getting one. When a process wishes to release a kernel semaphore lock, it invokes the up( ) function. This function is essentially equivalent to the following assembly language fragment:movl $sem->count,%ecxlock; incl (%ecx)jg 1flea %ecx,%eaxpushl %edxpushl %ecxcall _ _uppopl %ecxpopl %edx1:where _ _up( ) is the following C function:__attribute__((regparm(3))) void _ _up(struct semaphore *sem){wake_up(&sem->wait);}The up( ) function increases the count field of the *sem semaphore, and then it checks whether its value is greater than 0. The increment of count and the setting of the flag tested by the following jump instruction must be atomically executed, or else another kernel control path could concurrently access the field value, with disastrousresults. If count is greater than 0, there was no process sleeping in the wait queue, so nothing has to be done. Otherwise, the _ _up( ) function is invoked so that one sleeping process is woken up. Notice that _ _up( ) receives its parameter from the eax register (see the description of the _ _switch_to( ) function in the section "Performing the Process Switch" in Chapter 3).Conversely, when a process wishes to acquire a kernel semaphore lock, it invokes the down( ) function. The implementation of down( ) is quite involved, but it is essentially equivalent to the following:down:movl $sem->count,%ecxlock; decl (%ecx);jns 1flea %ecx, %eaxpushl %edxpushl %ecxcall _ _downpopl %ecxpopl %edx1:where _ _down( ) is the following C function:__attribute__((regparm(3))) void _ _down(struct semaphore * sem){DECLARE_WAITQUEUE(wait, current);unsigned long flags;current->state = TASK_UNINTERRUPTIBLE;spin_lock_irqsave(&sem->wait.lock, flags);add_wait_queue_exclusive_locked(&sem->wait, &wait);sem->sleepers++;for (;;) {if (!atomic_add_negative(sem->sleepers-1, &sem->count)) {sem->sleepers = 0;break;}sem->sleepers = 1;spin_unlock_irqrestore(&sem->wait.lock, flags);schedule( );spin_lock_irqsave(&sem->wait.lock, flags);current->state = TASK_UNINTERRUPTIBLE;}remove_wait_queue_locked(&sem->wait, &wait);wake_up_locked(&sem->wait);spin_unlock_irqrestore(&sem->wait.lock, flags);current->state = TASK_RUNNING;}The down( ) function decreases the count field of the *sem semaphore, and then checks whether its value is negative. Again, the decrement and the test must be atomically executed. If count is greater than or equal to 0, the current process acquires the resource and the execution continues normally. Otherwise, count is negative, and the current process must be suspended. The contents of some registers are saved on the stack, and then _ _down( ) is invoked.Essentially, the _ _down( ) function changes the state of the current process from TASK_RUNNING to TASK_UNINTERRUPTIBLE, and it puts the process in the semaphore wait queue. Before accessing the fields of the semaphore structure, the function also gets the sem->wait.lock spin lock that protects the semaphore wait queue (see "How Processes Are Organized" in Chapter 3) and disables local interrupts. Usually, wait queue functions get and release the wait queue spin lock as necessary when inserting and deleting an element. The _ _down( ) function, however, uses the wait queue spin lock also to protect the other fields of the semaphore data structure, so that no process running on another CPU is able to read or modify them. To that end, _ _down( ) uses the "_locked" versions of the wait queue functions, which assume that the spin lock has been already acquired before their invocations.The main task of the _ _down( ) function is to suspend the current process until the semaphore is released. However, the way in which this is done is quite involved. To easily understand the code, keep in mind that the sleepers field of the semaphore is usually set to 0 if no process is sleeping in the wait queue of the semaphore, and it is set to 1 otherwise. Let's try to explain the code by considering a few typical cases. MUTEX semaphore open (count equal to 1, sleepers equal to 0)The down macro just sets the count field to 0 and jumps to the nextinstruction of the main program; therefore, the _ _down( ) function is notexecuted at all.MUTEX semaphore closed, no sleeping processes (count equal to 0, sleepers equal to 0)The down macro decreases count and invokes the _ _down( ) function withthe count field set to -1 and the sleepers field set to 0. In each iteration of theloop, the function checks whether the count field is negative. (Observe thatthe count field is not changed by atomic_add_negative( ) because sleepers isequal to 0 when the function is invoked.)∙If the count field is negative, the function invokes schedule( ) tosuspend the current process. The count field is still set to -1, and thesleepers field to 1. The process picks up its run subsequently insidethis loop and issues the test again.∙If the count field is not negative, the function sets sleepers to 0 and exits from the loop. It tries to wake up another process in thesemaphore wait queue (but in our scenario, the queue is now empty)and terminates holding the semaphore. On exit, both the count fieldand the sleepers field are set to 0, as required when the semaphore isclosed but no process is waiting for it.MUTEX semaphore closed, other sleeping processes (count equal to -1, sleepers equal to 1)The down macro decreases count and invokes the _ _down( ) function withcount set to -2 and sleepers set to 1. The function temporarily sets sleepers to 2, and then undoes the decrement performed by the down macro by addingthe value sleepers-1 to count. At the same time, the function checks whethercount is still negative (the semaphore could have been released by theholding process right before _ _down( ) entered the critical region).∙If the count field is negative, the function resets sleepers to 1 andinvokes schedule( ) to suspend the current process. The count field isstill set to -1, and the sleepers field to 1.∙If the count field is not negative, the function sets sleepers to 0, tries to wake up another process in the semaphore wait queue, and exitsholding the semaphore. On exit, the count field is set to 0 and thesleepers field to 0. The values of both fields look wrong, becausethere are other sleeping processes. However, consider that anotherprocess in the wait queue has been woken up. This process doesanother iteration of the loop; the atomic_add_negative( ) functionsubtracts 1 from count, restoring it to -1; moreover, before returningto sleep, the woken-up process resets sleepers to 1.So, the code properly works in all cases. Consider that the wake_up( ) function in _ _down( ) wakes up at most one process, because the sleeping processes in the wait queue are exclusive (see the section "How Processes Are Organized" in Chapter 3).Only exception handlers , and particularly system call service routines , can use the down( ) function. Interrupt handlers or deferrable functions must not invoke down( ),because this function suspends the process when the semaphore is busy. For this reason, Linux provides the down_trylock( ) function, which may be safely used by one of the previously mentioned asynchronous functions. It is identical to down( ) except when the resource is busy. In this case, the function returns immediately instead of putting the process to sleep.A slightly different function called down_interruptible( ) is also defined. It is widely used by device drivers, because it allows processes that receive a signal while being blocked on a semaphore to give up the "down" operation. If the sleeping process is woken up by a signal before getting the needed resource, the function increases the count field of the semaphore and returns the value -EINTR. On the other hand, if down_interruptible( ) runs to normal completion and gets the resource, it returns 0. The device driver may thus abort the I/O operation when the return value is -EINTR.Finally, because processes usually find semaphores in an open state, the semaphore functions are optimized for this case. In particular, the up( ) function does not execute jump instructions if the semaphore wait queue is empty; similarly, the down( ) function does not execute jump instructions if the semaphore is open. Much of the complexity of the semaphore implementation is precisely due to the effort of avoiding costly instructions in the main branch of the execution flow.5.2.9. Read/Write SemaphoresRead/write semaphores are similar to the read/write spin locks described earlier in the section "Read/Write Spin Locks," except that waiting processes are suspended instead of spinning until the semaphore becomes open again.Many kernel control paths may concurrently acquire a read/write semaphore for reading; however, every writer kernel control path must have exclusive access to the protected resource. Therefore, the semaphore can be acquired for writing only if no other kernel control path is holding it for either read or write access. Read/write semaphores improve the amount of concurrency inside the kernel and improve overall system performance.The kernel handles all processes waiting for a read/write semaphore in strict FIFO order. Each reader or writer that finds the semaphore closed is inserted in the last position of a semaphore's wait queue list. When the semaphore is released, the process in the first position of the wait queue list are checked. The first process is always awoken. If it is a writer, the other processes in the wait queue continue to sleep. If it is a reader, all readers at the start of the queue, up to the first writer, are also woken up and get the lock. However, readers that have been queued after a writer continue to sleep.Each read/write semaphore is described by a rw_semaphore structure that includes the following fields:countStores two 16-bit counters. The counter in the most significant word encodesin two's complement form the sum of the number of nonwaiting writers(either 0 or 1) and the number of waiting kernel control paths. The counter inthe less significant word encodes the total number of nonwaiting readers andwriters.wait_listPoints to a list of waiting processes. Each element in this list is arwsem_waiter structure, including a pointer to the descriptor of the sleepingprocess and a flag indicating whether the process wants the semaphore forreading or for writing.wait_lockA spin lock used to protect the wait queue list and the rw_semaphorestructure itself.The init_rwsem( ) function initializes an rw_semaphore structure by setting the count field to 0, the wait_lock spin lock to unlocked, and wait_list to the empty list. The down_read( ) and down_write( ) functions acquire the read/write semaphore for reading and writing, respectively. Similarly, the up_read( ) and up_write( ) functions release a read/write semaphore previously acquired for reading and for writing. The down_read_trylock( ) and down_write_trylock( ) functions are similar todown_read( ) and down_write( ), respectively, but they do not block the process if the semaphore is busy. Finally, the downgrade_write( ) function atomically transforms a write lock into a read lock. The implementation of these five functions is long, but easy to follow because it resembles the implementation of normal semaphores; therefore, we avoid describing them.5.2.10. CompletionsLinux 2.6 also makes use of another synchronization primitive similar to semaphores: completions . They have been introduced to solve a subtle race condition that occurs in multiprocessor systems when process A allocates a temporary semaphore variable, initializes it as closed MUTEX, passes its address to process B, and then invokes down( ) on it. Process A plans to destroy the semaphore as soon as it awakens. Later。

外文文献翻译译文【范本模板】

在激光作用下核压力容器钢焊接接头的显微组织和力学性能摘要：设计间接热冲压工艺，利用有限元法对零件的几何尺寸和力学性能进行了预测.在间接热冲压过程的情况下，生产性能与适应车身部件,冷却路径造成扩散和扩散控制的相变。

通过人脸的相变引起的体积膨胀为面心立方（FCC）为体心立方（BCC）和体心四方（BCT）马氏体的形成导致相变诱导株的整体应力热冲压的车身部件的计算是很重要的。

计算的应力和应变状态正确，它是必要的模型的扩散和扩散控制的相变现象，考虑到间接热冲压过程的边界条件。

现有的材料模型进行分析和扩展以提高计算铁氧体、珍珠岩的数量和分布,其预测的准确性，整个退火过程中贝氏体和马氏体.工业用新方法在有限元程序LS-DYNA 971实现关键词：核钢稳压器压水反应堆反应堆压力容器结构完整性焊接韧性SA508钢通常用于民用核反应堆的关键部件,如反应堆压力容器。

核部件通常采用电弧焊接工艺，但与设计为未来的新建设项目超过60年的生活，新的焊接技术正在寻求.在这种探索性的研究,为第一时间，自体激光焊接6毫米厚的进行SA508 Cl。

3钢板使用16千瓦激光系统在4千瓦的功率运行。

这个显微组织和力学性能（包括显微硬度、抗拉强度、延伸率等夏比冲击韧性)的特点和结构进行了比较电弧焊接.基于移动体热的三维瞬态模型源模型也发展到模拟激光焊接热循环，以估计冷却速率的过程。

初步结果表明，激光焊接工艺可以无宏观缺陷的焊缝，激光焊接的强度和韧性在这项研究中的联合，得到的值,在焊接的母材条件。

反应堆压力容器的寿命和安全运行（RPV)，这是核电站中最关键的部件之一.取决于高温压力容器材料的耐久性，高压力和放射性环境.具有较高强度，韧性和抗辐照脆化的材料的需要是上升的，由于增加的发电容量和核电厂的设计寿命［1 ］，[ 2 ］，[ 3 ］，[ 4 ]，[ 5 ]，［7 ］，［8 ]和[ 6 ].SA508钢已经用于许多RPV？的压水反应堆制造因为他们提供的结合强度，延展性好，断裂韧性,相对于机械性能的均匀性，和他们的经济［9 ］、[ 10 ］、[ 11 ]和［12 ］.无人机是采用焊接厚环形锻件或SA508钢板在一起。

2010翻译大作业模板

Yangtze University College of Arts and Science 翻译大作业学号201041490班级英日5103姓名瞿小敏外语学部2013年6月提示：本页请勿装订。

任务说明：翻译实训平台英译中 3000字翻译实训平台中译英 2000字TQ实训平台项目任务一篇（篇幅不限）参考模板如下：翻译实训平台英译中原文：商务计划Overview China is set to surpass the United States as the world’s largest manufacturer by 2011.It is crucial for China’s economy to move beyond manufacturing and excel in technology and innovation for it to become the leading world power. Every year, 350,000 engineers graduate and enter the workforce. China has the capability; it must enable its younger generation to thrive in order to achieve success. Innovation and technology are the key success factors for empowering China’s economy. Technology clusters like Silicon Valley are instrumental for driving this growth. It is therefore essential for China to build clusters in order to incubate and accelerate technology. Plan, build and develop a Nanjing cluster that will drive innovation and growth for the Middle Kingdom is the first step towards achieving China’s goal. What are Clusters? Clusters are vital for the following reasons. Due to their strong entrepreneurship, innovation vitality and state-supported active networking, innovative clusters are an efficient component of economic growth. They can leverage Research and development driven innovation, knowledge transfer and financial flows without large public money outlay. Also, they constitute an existing core entity of an economy, within which collaboration among public, private and social partners already works. Clusters are defined as: geographic concentrations of interconnected companies, specialized suppliers, service providers, firms in related industries, and associated institutions that compete but also collaborate. They create an environment for generators of economic growth and employment opportunities. The power of an ecosystem In order to successfully create a cluster like Silicon Valley, there must be a vibrant ecosystem in place. This successful ecosystem is built on six pillars - government, universities, start-ups, large companies, venture capital and infrastructure. All six must work closely and effectively. One of the main factors of success is mobility of resources - people, capital, and ideas. The six pillars need to be closely linked and allow free flow between them. Recently , the cycle of innovation has largely been associated with what scholars describe as the “Triple Helix” model,which combines government, business, and public research in the development of knowledge-based innovation systems. We strongly believe that this is solely half of the inputs instrumental for success. Moreover, there must be alignment of incentives and goals. Building the ecosystem Our strong advantage is that we are building an ecosystem of tomorrow. There are technological parks that already exist in Nanjing, China and elsewhere in the world. However, it is essential to focus on the new generation, especially with the work-style trends morphing in the future. Drawing from experience in Silicon Valley, developing a cluster in the Middle East, as well as advising the leaders of major clusters worldwide on how to succeed, we have the resources to create this future center of innovation in Nanjing. What we propose We propose to create the next generation cluster in Nanjing. Our goal is to build an ecosystem that will drive innovation and economic growth with a window to the world. It will be a center of attraction, a place to live, work, learn and play. What will make it so important for companies is that the Nanjing Innovation Center will be a living lab for learning and testing. Products and services can first be tested and perfected in the cluster before being offered to the rest of China and the World.译文：商务计划概述 2011年，中国将超过美国成为世界上最大的制造商。

2-外文文献原稿和译文模板

Srivastava (1998) point out that customer satisfaction enhances efficiency in marketing through higher responsiveness of customers to marketing activities. Luo and Homburg (2007) investigate the link between satisfaction and efficient advertising and promotion. The authors argue that satisfaction leads to loyalty and word-of-mouth which in turn reduces the need for promotions. Improved marketing efficiency through word-of-mouth advertising (as a result of high customer satisfaction) is shown by Anderson (1998), as well. The results indicate that word-of-mouth is high for highly satisfied and highly unsatisfied consumers proposing a Ushaped relation between satisfaction and word-of-mouth engagement. The author also shows that dissatisfaction leads to higher word-of-mouth activity than high satisfaction which can be related to prospect theory. Prospect theory predicts that negative experience appear larger than positive experience as negative experience evoke larger emotions (Kahneman & Tversky,1979).斯里瓦斯塔瓦（1998）指出，客户满意度，通过客户的高响应性的营销活动在提高营销效率。

外文翻译模板

Waste Management 30 (2010) 1544–1555Large-scale direct shear testing of municipal solid waste Dimitrios Zekkos a,*, George A. Athanasopoulos b, Jonathan D. Bray c, Athena Grizi b, AndreasTheodoratos ba Department of Civil and Environmental Engineering, University of Michigan, 2358 GG BrownLaboratory, 2350 Hayward Street, Ann Arbor, MI 48109, USAb Dept. of Civil Engineering, Univ. of Patras, 26500 Rion, Greecec Department of Civil and Environmental Engineering, University of California at Berkeley, CA94720-1710, USAABSTRACTLarge direct shear testing (300 mm _ 300 mm box) of municipal solid waste (MSW) collected from a landfill located in the San Francisco Bay area was performed to gain insight on the shear response of MSW. The study investigated the effects of waste composition, confining stress, unit weight, and loading rate on the stress–displacement response and shear strength of MSW. The amount and orientation of the fibrous waste materials in the MSW were found to play a critical role. The fibrou s material had little effect on the MSW’s strength when it was oriented parallel to the shear surface, as is typically the case when waste material is compressed vertically and then tested in a direct shear apparatus. Tests in which the fibrous material was oriented perpendicular to the horizontal shear surface produced significantly stronger MSW specimens. The test results indicate that confining stress and loading rate are also important factors. Based on 109 large-scale direct shear tests, the shear strength of MSW at low moisture contents is best characterized by cohesion = 15 kPa, friction angle = 36_ at a normal stress of 1 atmosphere, and a decrease in the friction angle of 5_ for every log-cycle increase in normal stress.1. IntroductionThe response in shear of municipal solid waste (MSW) is an important consideration in landfill design, particularly for the evaluation of a landfill’s static and seismic stability. Several MSW landfill instabilities have occurred in recent years, including the Rumpke Landfill in Ohio (Eid et al., 2000), Dona Juanna Landfill in Colombia (Hendron et al., 1999), Payatas Landfill in Philippines (Kavazanjian and Merry, 2005), and Java landfill in Indonesia (Koelschet al., 2005). These failures had significant economic consequences and in some cases resulted in the loss of human life. An improved understanding of the shear response of MSW is required to support sound stability evaluations of landfills.With the aim of providing insights regarding the mechanical response of MSW, acollaborative research program that involved the University of California at Berkeley, Arizona State University, Geosyntec Consultants, University of Patras (Greece), and the University of Texas at Austin was undertaken. One of its primary objectives was to evaluate the static and dynamic properties of MSW by systematically characterizing and testing MSW in the field and laboratory. Findings of the collaborative investigation are summarized in Zekkos et al. (2008a). Recommendations for estimating the unit weight of MSW (Zekkos et al., 2006) and the dynamic properties of MSW (Zekkos et al., 2008a) have been presented elsewhere. An overall assessment of the shear strength of MSW using.2. Literature reviewThe strength envelope recommended by Kavazanjian et al. (1995) is often used in engineering practice to characterize the shear strength of MSW. This bilinear strength envelope consists of a purely cohesive material with cohesion (c) of 24 kPa for normal stresses up to 30 kPa and a purely frictional material with a friction angle (/) of 33_ at higher normal stresses. The envelope was intended to be a conservative estimate of the shear strength of MSW; it was based on a limited number of laboratory and field tests and the back-calculation of stable waste slopes. More recently,Eid et al. (2000) relied on a larger database of laboratory data and back-calculations of three unstable slopes in developing a linear shear strength envelope that was characterized on average by c = 25 kPa and / = 35_. Zekkos (2005) performed an extensive review of the literature and identified significant differences in the MSW shear strength parameters proposed by other researchers. Mohr–Coulomb strength parameters with cohesions varying from 0 to 80 kPa and friction angles varying from 0_ to 60_ have been proposed by several different researchers (Fig. 1). The selected value of the cohesion and friction angle used in conducting andfill analyses is obviously critical.3. Characterization of the waste tested in this studyTwo large-diameter (760 mm) borings were augered to depths of 10 m and 32 m using a bucket auger at the Tri-Cities landfill, located in the San Francisco Bay area in north California. Bulk waste samples from small and large depths, varying in age from 0 to 15 years old, were retrieved and stored separately in 39 sealed 55-gallon drums of bulk waste material. Excessive grinding of the waste particles was not observed, so the collected waste materials are assumed to be unprocessed. Two to four drums of waste were collected at each 3 m sampling interval. The in situ unit weight of waste was measured using the procedures described in Zekkos et al. (2006). Its unit weight increased from 10 kN/m3 near the surface to 16 kN/m3 at greater depths. Waste material was transported to the Richmond Field Station of the University of California at Berkeley, where it was characterized. Waste characterizationincluded separating the waste material into material larger and smaller than 20 mm. This segregation is considered useful, because material <20 mmis composed of soil-like material that is derived primarily from daily cover, other soil materials, and some fine waste inclusions, whereas material >20 mm generally consists of bulk and fibrous waste materials. Additionally, material <20 mm can be characterized using conventional soil mechanics index tests, such as sieve analyses and Atterberg limits, and it can be tested using geotechnical testing equipment.Waste samples that were collected as part of this study form three general classes. Class A is relatively ‘‘deep old waste” and included sample groups A1–A4. Class B is ‘‘deep old waste with fibrous <20 mm material” and included sample group B1. Class C is ‘‘shallow fresh waste” and included sample groups C1–C6. Classes A and B waste were placed in 1987; whereas Class C waste was placed after 1999. The percentage by weight of the <20 mm material and the amount of plastic, paper, wood, gravel and other constituents of the >20 mm material were measured for a total of 6 waste sample groups. The mass of the processed samples varied from 60 to 320 kg. About 50–75% of the total waste sample by weight was <20 mm material, and the >20 mm material consisted primarily of paper, plastic, wood, and gravel. Other constituents such as metals, glass, stiff plastics, and textiles, comprised a significantly lower percentage of the material by weight and by volume. Details of the field investigation and waste characterization are provided in Zekkos (2005).ReferencesAthanasopoulos, G., Grizi, A., Zekkos, D., Founta, P., Zisimatou, E., 2008. Municipal Solid Waste as a Reinforced Soil: Investigation Using Synthetic Waste. ASCE, GSP No. 177, pp. 168–175.Bray, J.D., Zekkos, D., Kavazanjian Jr., E., Athanasopoulos, G.A., Riemer, M.F., 2009. Shear strength of municipal solid waste. Journal of Geotechnical and Geoenvironmental Engineering, ASCE 135 (6),709–722.Caicedo, B., Yamin, L., Giraldo, E., Coronado, O., 2002. Geomechanical properties of municipal solid waste in Dona Juana sanitary landfill. In: Proceeding of the Fourth International Congress on Environmental Geotechnics, Brazil, vol. 1, pp. 177–182.Duncan, J.M., Wright, S.G., 2005. Soil Strength and Slope Stability. John Wiley & Sons Inc.. Edincliler, A. Benson, C.H., Edil, T.B., 1996. Shear strength of municipal solid waste. Interim Report –Year 1, Environmental Geotechnics Report 96-2, Department of Civil and Environmental Engineering, University of Wisconsin, Madison.Eid, H.T., Stark, T.D., Douglas, W.D., Sherry, P.E., 2000. Municipal solid waste slope failure 1. Waste and foundation properties. Journal of Geotecnical and Geoenvironmental Engineering, ASCE 126 (5), 397–407. Gabr, M.A., Valero, S.N., 1995. Geotechnical properties of municipal solid waste. Geotechnical Testing Journal 18, 241–254.Grizi, A., 2006. Mechanical Behavior of MSW-Laboratory Test Results in Large Shear Box Apparatus. Diploma Thesis, Department of Civil Engineering, University of Patras, Patras (in Greek).Hendron, D.M., Fernandez, G., Prommer, P.J., Giroud, J.P., Orozco, L.F., 1999. Investigation of the cause of the 27 September 1997 slope failure at the Dona Juana landfill. In: Proceedings of Sardinia, p. 99. Houston, W.N., Houston, S.L., Liu, J.W., Elsayed, A., Sanders, C.O., 1995. In situ testing methods for dynamic properties of MSW landfills. Earthquake design and performance of solid waste landfills. ASCE Geotechnical Special Publication No. 54, pp. 73–82.Kavazanjian Jr., E., Matasovic, N., Bonaparte, R., Schmertmann, G.R.,1995. Evaluation of MSW properties for seismic analysis. Geoenvironment 2000. Geotechnical Special Publication No. 46, pp.1126–1141.Kavazanjian Jr., E., 1999. Seismic design of solid waste containment facilities. In: Proceedings of the Eighth Canadian Conference on Earthquake Engineering. Vancouver, BC, pp. 51–89.Kavazanjian Jr., T., Merry S.M., 2005. The 10 July 2000 Payatas landfill failure. In: Proceedings of Sardinia.Koelsch, F., Fricke, K., Mahler, C., Damanhuri, E., 2005. Stability of landfills – the Bandung dumpsite disaster. In: Proceedings of Sardinia.Landva, A.O., Clark, J.I., 1986. Geotechnical testing of wastefill. In: Proceedings, 39th Canadian Geotechnical Conference Ottawa, Ontario, pp. 371–385.Landva, A.O., Clark, J. I., 1990. Geotechnics of waste fill. In: Landva and Knowles (Ed.), Theory and Practice, STP 1070, ASTM, pp. 86–103.Mahler, C.F., De Lamare Netto, A., 2003. Shear resistance of mechanical biological pre-treated domestic urban wast. In: Proceedings Sardinia 2003, Ninth International Waste Management and Landfill Symposium, 6–10 October 2003.Matasovic, N., Kavazanjian, E. Jr., 1998. Cyclic characterization of OII landfill solid waste. ASCE, Journal of Geotechnical and Geoenvironmental Engineering 124(3), 197–210.Mazzucato, N., Simonini, P., Colombo, S., 1999. Analysis of block slide in a MSW landfill. In: Proceedings Sardinia 1999, Seventh International Waste Management and Landfill Symposium, Cagliari, Italy, 4–8 October 1999.Pelkey, S.G., 1997. Geotechnical properties of municipal solid waste. Thesis submitted in partial fulfillment of the requirements for the degree of Masters of Science in Engineering, Department of Civil Engineering, The University of New Brunswick.Richardson, G., Reynolds, D., 1991. Geosyntetic considerations in a landfill on compressible clays. Procee dings of Geosynthetics ‘91, vol. 2. Industrial Fabrics Association International, St. Paul, MN. Siegel, R.A., Robertson, R.J., Anderson, D.G., 1990. Slope stability investigations at a landfill in southern California, American Society for Testing and Materials, ASTM. Special Technical Publication, STP 1070,pp. 259–284.Stoll, O.W., 1971. Mechanical properties of milled refuse. In: ASCE National Water Resources Engineering Meeting, Phoenix, Arizona, January 11–15.Theodoratos, A., 2007. Evaluation of MSW Shear Strength With Laboratory Direct Shear Testing. M.Sc. Thesis, Department of Civil Engineering, University of Patras, Patras (in Greek).Vilar, O.M., Carvalho, M.F., 2002. Shear strength properties of municipal solid waste. In: Proceeding of the Fourth International Congress on Environmental Geotechnics, Brazil, vol. 1, pp. 59–64.Withiam, J.L., Tarvin, P.A., Bushell, T.D., Snow, R.E., German, H.W., 1995.Prediction and performance of municipal landfill slope. In: Proceedings nternational Conference the Geoenvironment 2000, ASCE GSP No. 46, NY, pp. 1005–1019.Zekkos, D.P., 2005. Evaluation of static and dynamic properties of municipal solidwaste. Ph.D. Thesis, Department of Civil and Environmental Engineering,University of California at Berkeley.Zekkos, D., Bray, J.D., Kavazanjian Jr., E., Matasovic, N., Rathje, E.M., Riemer, M.F., Stokoe, K .H., 2006. Unit weight of municipal solid waste. ASCE Journal of Geotechnical and Geoenvironmental Engineering 132 (10), 1250–1261.Zekkos, D., Bray J.D., Athanasopoulos, G.A., Riemer, M.F., Kavazanjian, E., Founta, X., Grizi, A., 2007. Compositional and loading rate effects on the shear strength of municipal solid waste. In: 4th International Conference on Earthquake Geotechnical Engineering, Thessaloniki, Greece, June 25–28, 2007, Paper No. 1525.Zekkos, D., Bray, J. D., Stokoe, K., Kavazanjian, E., Rathje, E., Athanasopoulos, G.A., Riemer, M., Matasovic, N., Lee, J.J., Seos, B., 2008a. Recent Findings on the Static and Dynamic Properties of Municipal Solid Waste, ASCE-Geoinstitute Geocongress 2008a, Geotechnics of Waste Management and Remediation. Geotechnical Special Publication (GSP) No. 177, pp. 176–183.Zekkos, D., Bray, J.D., Riemer, M .F., 2008b. Large-scale cyclic triaxial characterization of the dynamic properties of municipal solid waste. Canadian Geotechnical Journal 45 (1), 45–58.废物管理30 (2010) 1544–1555大规模的都市固体废物直接剪切试验Dimitrios Zekkos a,*, George A. Athanasopoulos b, Jonathan D. Bray c, Athena Grizi b, AndreasTheodoratos ba土木与环境工程学院，密歇根大学，布朗实验室，海沃德街，安阿伯，美国b土木工程系，大学。

外文翻译原文模板

1、外文资料翻译内容要求：外文资料的内容应为本学科研究领域，并与毕业设计（论文）选题相关的技术资料或专业文献，译文字数应不少于3000汉字以上，同时应在译文末注明原文的出处。

不可采用网络中直接有外文和原文的。

2、外文资料翻译格式要求：译文题目采用小二号黑体，居中；译文正文采用宋体小四号，段前、段后距为0行；行距：固定值20磅。

英文原文如果为打印的话用新罗马（Times New Roman）小四号字。

装订时原文在前，译文在后。

文章中有引用的地方在原文中也要体现。

参考文献也要翻译成中文！An Energy-Efficient Cooperative Algorithm for Data Estimation inWireless Sensor NetworksAbstract – In Wireless Sensor Networks (WSN), nodes operate on batteries and network’s lifetime depends on energy consumption of the nodes. Consider the class of sensor networks where all nodes sense a single phenomenon at different locations and send messages to a Fusion Center (FC) in order to estimate the actual information. In classical systems all data processing tasks are done in the FC and there is no processing or compression before transmission. In the proposed algorithm, network is divided into clusters and data processing is done in two parts. The first part is performed in each cluster at the sensor nodes after local data sharing and the second part will be done at the Fusion Center after receiving all messages from clusters. Local data sharing results in more efficient data transmission in terms of number of bits. We also take advantage of having the same copy of data at all nodes of each cluster and suggest a virtual Multiple-Input Multiple-Output (V-MIMO) architecture for data transmission from clusters to the FC. A Virtual-MIMO network is a set of distributed nodes each having one antenna. By sharing their data among themselves, these nodes turn into a classical MIMO system. In the previously proposed cooperative/virtual MIMO architectures there has not been any data processing or compression in the conference phase. We modify the existing VMIMO algorithms to suit the specific class of sensor networks that is of our concern. We use orthogonal Space-Time Block Codes (STBC) for MIMO part and by simulation show that this algorithm saves considerable energy compared to classical systems.I. INTRODUCTIONA typical Wireless Sensor Network consists of a set of small, low-cost and energy-limited sensor nodes which are deployed in a field in order to observe a phenomenon and transmit it to a Fusion Center (FC). These sensors are deployed close to one another and their readings of the environment are highly correlated. Their objective is to report a descriptive behavior of the environment based on all measurements to the Fusion Center. This diversity in measurement lets the system become more reliable and robust against failure. In general, each node is equipped with a sensing device, a processor and a communication module (which can be either a transmitter or transmitter/receiver).Sensor nodes are equipped with batteries and are supposed to work for a long period of time without battery replacement. Thus, they are limited in energy and one of the most important issues in designing sensor networks will be the energy consumption of the sensor nodes. To deal with this problem, we might either reduce the number of bits to be transmitted by source compression or reduce the required power for transmission by applying advanced transmission techniques while satisfying certain performance requirement.A lot of research has been done in order to take advantage of the correlation among sensors’ data for reducing the number of bits to be transmitted. Some are based on distributed source coding[1]while others use decentralized estimation[2-5]. In [1], authors present an efficient algorithm that applies distributed compression based on Slepian – Wolf[14] encoding technique and use an adaptive signal processing algorithm to track correlation among sensors data. In [2-5] the problem of decentralized estimation in sensor networks has been studied under different constraints. In these algorithms, sensors perform a local quantization on their data considering that their observations are correlated with that of other sensors. They produce a binary message and send it to the FC. FC combines these messages based on the quantization rules used at the sensor nodes and estimates the unknown parameter. Optimal local quantization and final fusion rules are investigated in these works. The distribution of data assumed for sensor observation in these papers has Uniform probability distribution function. In our model we consider Gaussian distribution introduced in [17] for sensor measurements which ismore likely to reality.As an alternative approach, some works have been done using energy-efficient communication techniques such as cooperative/virtual Multiple-Input Multiple-Output (MIMO) transmission in sensor networks [6-11]. In these works, as each sensor is equipped with one antenna, nodes are able to form a virtual MIMO system by performing cooperation with others. In [6] the application of MIMO techniques in sensor networks based on Alamouti[15] space-time block codes was introduced. In [8,9] energy-efficiency of MIMO techniques has been explored analytically and in [7] a combination of distributed signal processing algorithm presented and in [1] cooperative MIMO was studied.In this paper, we consider both techniques of compression and cooperative transmission at the same time. We reduce energy consumption in two ways; 1) processing data in part at the transmitting side, which results in removing redundant information thus having fewer bits to be transmitted and 2) reducing required transmission energy by applying diversity and Space-Time coding. Both of these goals will be achieved by our proposed two-phase algorithm. In our model, the objective is to estimate the unknown parameter which is basically the average of all nodes’ measurements. That is, exact measurements of individual nodes are not important and it is not necessary to spend a lot of energy and bandwidth to transmit all measured data with high precision to the FC. We can move some part of data processing to the sensors side. This can be done by local data sharing among sensors. We divide the network into clusters of ‘m’ members. The number of members in the cluster (m) is both the compression factor in data processing and also the diversity order in virtual-MIMO architecture. The remaining of this paper is organized as following: in section II we introduce our system model and basic assumptions. In section III we propose our collaborative algorithm. In section IV we present the mathematical analysis of the proposed algorithm and in section V we give some numerical simulations. Finally section VI concludes the paper.II. SYSTEM MODELA. Network ModelThe network model that we use is similar to the one presented in [2-5].Our network consists of N distributed Sensor Nodes (SN) and a Fusion Center (FC). Sensors are deployed uniformly in the field, close to one another and each taking observations on an unknown parameter (θ). Fusion Center is located far from the nodes. All nodes observe same phenomenon but with different measurements. These nodes together with the Fusion Center are supposed to find the value of the unknown parameter. Nodes send binary messages to Fusion Center. FC will process the received messages and estimate the unknown value.B. Data ModelIn our formulation we use the data model introduced in[17]. We assume that all sensors observe the same phenomenon (θ) which has Gaussian distribution with variance σx 2. They observe different versions of θ and we model this difference as an additive zero mean Gaussian noisewith variance σn 2. Therefore, sensor observations will be described byn i i θx += （1） Where θ ~ N (0, σx 2) and n i ~ N (0, σn 2) for i = 1, 2, … , N .Based on thisassumption the value of θ can be estimated by taking the numerical average of the nodes observations, i.e.∑==N i i x N 11θ（2）C. Reference System ModelOur reference system consists of N conventional Single Input Single Output (SISO) wireless links, each connecting one of the sensor nodes to the FC. For the reference system we do not consider any communication or cooperation among the sensors. Therefore each sensor quantizes its observation by an L-bit scalar quantizer designed for distribution of θ, generates a message of length L and transmits it directly to the FC. Fusion Center receives all messages and performs the processing, which is calculation of the numerical average of these messages.III. COOPERATIVE DATA PROCESSING ALGORITHMSensor readings are analog quantities. Therefore, each sensor has to compress its data into several bits. For data compression we use L -bit scalar quantizer [12,13].In our algorithm, network is divided into clusters, each cluster having a fixed and pre-defined number of members (m). Members of each cluster are supposed to cooperate with one another in two ways:1. Share, Process and Compress their data2. Cooperatively transmit their processed data using virtual MIMO.IV. ANALYSISThe performance metric considered in our analysis is the total distortion due to compression and errors occurred during transmission. The first distortion is due to finite length quantizer, used in each sensor to represent the analog number by L bits. This distortion depends on the design of quantizer.We consider a Gaussian scalar quantizer which is designed over 105 randomly generated samples. The second distortion is due to errors occurred during transmission through the channel. In our system, this distortion is proportional to the probability of bit error. Since the probability of bit error (Pe) is a function of transmission energy per bit (Eb), total distortion will be a function of Eb. In this section we characterize the transmission and total consumed energy of sensors and find the relationship between distortion and probability of bit error.V. SIMULATION AND NUMERICAL RESULTS To give a numerical example, we assume m = 4 members in each cluster. Therefore our Virtual-MIMO scheme will consist of 4 transmit antennas. We assume that network has N = 32 sensors. Sensor observations are Gaussian with σx2= 1 and are added to a Gaussian noise of σn2= 0.1 .Nodes are deployed uniformly in the field and are 2 meters apart from each other and the Fusion Center is located 100 meters away from the center of the field. The values for circuit parameters are quoted from [6] and are listed in Table I. These parameters depend on the hardware design and technological advances. Fig. 1 illustrates the performance (Distortion) of reference system and proposed two-phase V-MIMO scheme versus transmission energy consumption in logarithmic scale. As shown in the figures, depending on how much precision is needed in the system, we can save energy by applying the proposed algorithm.TABLE IFig. 2 illustrates the Distortion versus total energy consumption of sensor nodes. That is, in this figure we consider both the transmission and circuit energy consumption. The parameters that lead us to these results may be designed to give better performance than presented here. However, from these figures we can conclude that the proposed algorithm outperforms the reference system when we want to have distortion less than 10−3 and it can save energy as high as 10 dB.VI. CONCLUSIONIn this paper we proposed a novel algorithm which takes advantage of cooperation among sensor nodes in two ways: it not only compresses the set of sensor messages at the sensor nodes into one message, appropriate for final estimation but also encodes them into orthogonal space-time symbols which are easy to decode and energy-efficient. This algorithm is able to save energy as high as 10 dB.REFERENCES[1] J.Chou,D.Petrovic and K.Ramchandran “A distributed and adaptive signalprocessing approach to reducing energy consumption in sensornetworks,”Proc. IEEE INFOCOM,March 2003.[2] Z.Q.Luo, “Universal decentralized estimation in a bandwidth constrainedsensor network,” IEEE rmation The ory, vol.51,no.6,June 2005.[3] Z.Q.Luo,“An Isotropic Universal decentralized estimation scheme for abandwidth constrained Ad Hoc sensor network,”IEEEm. vol.23,no. 4,April 2005.[4] Z.Q.Luo and J.-J. Xiao, “Decentralized estimation i n an inhomogeneoussensing environment,” IEEE Trans. Information Theory, vol.51, no.10,October 2005.[5] J.J.Xiao,S.Cui,Z.-Q.Luo and A.J.Goldsmith, “Joint estimation in sensornetworks under energy constraints,” Proc.IEEE First conference on Sensor and Ad Hoc Communications and Networks, (SECON 04),October 2004.[6] S.Cui, A.J.Goldsmith, and A.Bahai,“Energy-efficiency of MIMO andcooperative MIMO techniques in sensor networks,”IEEEm,vol.22, no.6pp.1089–1098,August 2004.[7] S.K.Jayawe era and M.L.Chebolu, “Virtual MIMO and distributed signalprocessing for sensor networks-An integrated approach”,Proc.IEEEInternational Conf. Comm.(ICC 05)May 2005.[8] S.K.Jayaweera,"Energy efficient virtual MIMO-based CooperativeCommunications for Wireless Sensor Networks",2nd International Conf. on Intelligent Sensing and Information Processing (ICISIP 05),January 2005.[9] S.K.Jayaweera,“Energy Analysis of MIMO Techniques in Wireless SensorNetworks”, 38th Annual Conference on Information Sciences and Systems (CISS 04),March 2004.[10] S.K.Jayaweera and M.L.Chebolu,“Virtual MIMO and Distributed SignalProcessing for Sensor Networks - An Integrated Approach”,IEEEInternational Conf.on Communications (ICC 05),May 2005.[11] S.K.Jayaweera,“An Energy-efficient Virtual MIMO CommunicationsArchitecture Based on V-BLAST Processing for Distributed WirelessSensor Networks”,1st IEEE International Conf.on Sensor and Ad-hocCommunications and Networks (SECON 2004), October 2004.[12] J.Max,“Quantizing for minimum distortion,” IRE rmationTheory,vol.IT-6, pp.7 – 12,March 1960.[13] S.P.Lloyd,“Least squares quantization in PCM ,”IEEE rmationTheory,vol.IT-28, pp.129-137,March 1982.[14] D.Slepian and J.K.Wolf “Noiseless encoding of correlated inf ormationsources,” IEEE Trans. on Information Theory,vol.19, pp.471-480,July1973.[15] S.M.Alamouti,“A simple transmit diversity technique for wirelesscommunications,” IEEE m., vol.16,no.8,pp.1451–1458,October 1998.[16] V.Tarokh,H.Jafarkhani,and A.R.Calderbank. “Space-time block codesfrom orthogonal designs,’’IEEE rmationTheory,vol.45,no.5,pp.1456 -1467,July 1999.[17] Y.Oohama,“The Rate-Distortion Function for the Quadratic GaussianCEO Problem,” IEEE Trans. Informatio nTheory,vol.44,pp.1057–1070,May 1998.。

外文翻译及外文原文(参考格式)

外文翻译要求：1、外文资料与毕业设计（论文）选题密切相关，译文准确、质量好。

2、阅读2篇幅以上（10000字符左右）的外文资料，完成2篇不同文章的共2000汉字以上的英译汉翻译3、外文资料可以由指导教师提供，外文资料原则上应是外国作者。

严禁采用专业外语教材文章。

4、排序：“一篇中文译文、一篇外文原文、一篇中文译文、一篇外文原文”。

插图内文字及图名也译成中文。

5、标题与译文格式（字体、字号、行距、页边距等）与论文格式要求相同。

下页附：外文翻译与原文参考格式2英文翻译 (黑体、四号、顶格)外文原文出处：(译文前列出外文原文出处、作者、国籍，译文后附上外文原文)《ASHRAE Handbook —Refrigeration 》.CHAPTER3 .SYSTEM Practices for ammonia 3.1 System Selection 3.2 Equipment3.10 Reciprocating Compressors第3章氨制冷系统的实施3.1 系统选择在选择一个氨制冷系统设计时，须要考虑一些设计决策要素，包括是否采用（1）单级压缩（2）带经济器的压缩（3）多级压缩（4）直接蒸发（5）满液式（6）液体再循环（7）载冷剂。

单级压缩系统基本的单级压缩系统由蒸发器、压缩机、冷凝器、储液器（假如用的话）和制冷剂控制装置（膨胀阀、浮球阀等）。

1997 ASHRAE 手册——“原理篇”中的第一章讨论了压缩制冷循环。

图1.壳管式经济器的布置外文翻译的标题与译文中的字体、字号、行距、页边距等与论文格式相同。

英文原文(黑体、四号、顶格)英文翻译2（黑体，四号，顶格）外文原文出处：（黑体，四号，顶格）P. Fanning. Nonlinear Models of Reinforced and Post-tensioned Concrete Beams. Lecturer, Department of Civil Engineering, University College Dublin. Received 16 Jul 2001.非线形模型钢筋和后张法预应力混凝土梁摘要:商业有限元软件一般包括混凝土在荷载做用下非线性反应的专用数值模型。

外文翻译范本

西安科技大学高新学院本科毕业设计本科毕业设计（（论文论文））外文翻译译文外文翻译译文学生姓名学生姓名学生姓名 : 熊静院院（系）: 建筑与土木工程专业班级专业班级专业班级 : 工程管理0703 指导教师指导教师指导教师 : 胥卫平完成日期完成日期完成日期 : 2010年10月10日求要求1、外文翻译是毕业设计（论文）的主要内容之一，必须学生独立完成。

2、外文翻译译文内容应与学生的专业或毕业设计（论文）内容相关，不得少于15000印刷符号。

3.外文翻译译文用A4纸打印。

文章标题用3号宋体，章节标题用4号宋体，正文用小4号宋体，20磅行距；页边距上、下、左、右均为2.5cm，左侧装订，装订线0.5cm。

按中文翻译在上，外文原文在下的顺序装订。

4、年月日等的填写，用阿拉伯数字书写，要符合《关于出版物上数字用法的试行规定》，如“2005年2月26日”。

5、所有签名必须手写，不得打印。

房地产市场的泡沫理查德赫林苏珊沃特泽尔/ Lurie房地产中心工作文件＃402理查德赫林沃顿商学院宾夕法尼亚大学宾夕法尼亚州费城，19104 herring@苏珊沃特沃顿商学院宾夕法尼亚大学宾夕法尼亚州费城，19104wachter@ 2002年3月2002年4月22-24日，在芝加哥编写了与世界银行，芝加哥联邦储备银行集团的会议“资产价格泡沫：货币的含义，法规，政策和国际政策。

/newsletter/bubbles.pdf房地产市场的泡沫理查德赫林、苏珊沃特简介房地产泡沫可能会出现没有银行危机。

和银行业危机可能没有出现房地产泡沫。

但是，这两种现象都在显着的相关实例数据。

实体经济的后果，对银行的依赖作用在该国的金融体系。

在美国，银行只持有约22％的总资产，大多数借款人可以找到替代品的银行贷款和一般的影响经济活动水平相对轻微。

但是，在一些国家，银行扮演更主导作用，如美国的大萧条之前，大（其中银行持有65％的总资产），或现今日（其中79％的资产银行持有的总数），或新兴市场（如银行往往持有超过80％的资产总额），为的后果实体经济可以更加严峻。

外文翻译-参考模板

外文翻译:光催化剂CeFeO3的合成和表征及其光催化降解龙胆紫J. Ameta a, A. Kumar a, R. Ameta b,*, V.K. Sharma a and S.C. Ameta aa光化学与太阳能实验室，化学系，科学学院，穆汉拉尔苏哈迪亚大学，乌代布尔，印度b Meera女子公立学院，乌代布尔-313001（拉贾斯坦邦），印度摘要：三元氧化物作为有效的光催化剂已在众多化学反应中应用。

这些氧化物催化剂的制备方法对其催化性能有重要影响。

在近期研究中，铈铁氧化物催化剂通过共沉淀法和独特的加热周期已成功合成。

合成的催化剂用X射线衍射仪表征。

染料龙胆紫作为降解物，用合成的催化剂对其光催化降解，反应进行的程度用分光光度计检测。

文中讨论了一些影响因素，例如龙胆紫溶液的浓度，pH，半导体的用量和光照强度，并且提出了龙胆紫光催化降解的机理。

关键词：光催化剂，CeFeO3,光催化降解，龙胆紫引言治理水污染的方法很多，例如加热脱水，碳吸附等。

其中最经济环保的方法就是光催化反应。

下述是文献查阅到的光催化反应在污水治理方面的应用。

Alton和Ferry把SiW12O4作为光催化剂，光催化降解酸性橙7[1]。

Blajeni等人在SrTiO3和TiO2悬乳液中，把CO2和水光还原成甲醛和甲醇[2]。

Domen等人研究用催化剂NiO-SrTiO3光催化分解水蒸气[3]。

Priya和Madras研究用煅烧合成的纳米TiO2光催化降解硝基苯[4]。

Chen等人研究在紫外光和可光照射下，一维纳米TiO2光降解有色染料污染[5]。

Wang等人进行了Sn(IV)掺杂纳米TiO2降解橘黄G的动力学研究[6]。

Kako等人针对TiO2催化降解H2S的催化中毒提出预防措施[7]。

Chittora等人用ZnO,Fe2O3等光催化剂光还原CO2[8]。

Muradav等人用催化剂Pt/CdS胶粒在H2S溶液里脱氢[9]。

Swarnkar等人研究了龙胆紫在CdS半导体表面的光催化漂白[10]。

毕业论文翻译稿件【范本模板】

本科毕业论文外文翻译外文译文题目：对于E类型的简单生产线平衡问题的解决过程学院: 机械自动化专业: 工业工程学号: 201003166078学生姓名：谭柱森指导教师: 李颖日期: 二○一四年五月A solution procedure for type E simple assembly linebalancing problemNai—Chieh Wei , I-Ming ChaoIndustrial Engineering and Management，I—Shou University，No. 1，Section 1, Syuecheng Rd. Dashu District, KaohsiungCity 84001，Taiwan, ROC.对于E类型的简单生产线平衡问题的解决过程Nai-Chieh Wei , I-Ming Chao工业工程与管理，中华人民共和国，台湾省，高雄市，Syuecheng Rd。

Dashu街一号，义守大学，第一章第一节摘要本文提出了结合SALBP—1和SALBP-2的E型简单装配线平衡问题（SALBP—E），更多的,本研究为提出的模型提供了解决方法。

提出的模型在最小化空闲时间的同时优化装配线平衡率，为管理实践提供了更好的理解,计算结果表明：给出周期的上限ct以后,提出的模型可以最优的解决问题，因为它含有最少的变量,约max束和计算时间。

1前言从研究者第一次讨论装配线平衡问题以来，大约有50年了，在众多有关生产线平衡问题中,最基本的是简单装配线平衡问题，早在1954年，Bryton就定义并且研究了生产线平衡问题。

后一年，Salverson建立了第一个生产线平衡的数学模型并提出了定性的解决步骤,这引来了很大的兴趣，在Gutjahr 和Nemhauser说明生产线平衡是一种NP组合优化难题，大多数研究者希望开发一种能高效解决多种装配线问题的方法。

在随后的几年,生产线平衡成为了一个流行的主题，Kim，Kim，and Kim （1996）把生产线平衡分为五类问题，其中的问题1（SALBP —1）和问题Ⅱ（SALBP—Ⅱ)是两种基本的优化问题。