东北大学论文格式要求

合集下载

东北大学秦皇岛分校本科生毕业设计(论文)撰写规范

东北大学秦皇岛分校本科生毕业设计(论文)撰写规范毕业设计(论文)是培养学生综合运用本学科的基本理论、专业知识和基本技能，提高分析和解决实际问题的能力，完成初步培养从事科学研究工作和专业工程技术工作基本训练的重要环节。

为了统一和规范我校本科生毕业设计(论文)的写作，保证我校本科生毕业设计(论文)的质量，根据《中华人民共和国国家标准科学技术报告、学位论文和学术论文的编写格式》（国家标准GB7713-87）的规定，制定《东北大学秦皇岛分校本科生毕业设计(论文)撰写规范》：1 内容要求1.1 论文题目论文题目应该简短、明确、有概括性。

读者通过题目，能大致了解论文的内容、专业的特点和学科的范畴。

题目要符合汉语逻辑，字数要适当，一般不宜超过24字。

必要时可加副标题。

1.2 摘要与关键词1.2.1 论文摘要论文摘要应概括地反映出毕业设计(论文)的目的、内容、方法、成果和结论。

摘要中不宜使用公式、图表，不标注引用文献编号。

摘要应是一篇完整的短文，篇幅以300～500字为宜。

1.2.2 关键词关键词是供检索用的主题词条，应采用能覆盖论文主要内容的通用技术词条（参照相应的技术术语标准）。

关键词一般为3～5个，按词条的外延层次排列（外延大的排在前面）。

1.3 目录目录按章、节、条三级标题编写，要求标题层次清晰。

目录中的标题要与正文中标题一致。

目录中应包括绪论、论文主体、结论、致谢、参考文献、附录等。

1.4 论文正文论文正文是毕业设计(论文)的主体和核心部分，一般应包括绪论、论文主体及结论等部分。

1.4.1 绪论绪论一般作为第一章，是毕业设计(论文)主体的开端。

绪论应包括：毕业设计的背景及目的；国内外研究状况和相关领域中已有的研究成果；课题的研究方法；论文构成及研究内容等。

绪论一般不少于2千字。

1.4.2 论文主体论文主体是毕业设计(论文)的主要部分，应该结构合理，层次清楚，重点突出，文字简练、通顺。

论文主体的内容应包括以下各方面：(1) 毕业设计(论文)总体方案设计与选择的论证。

东北大学秦皇岛分校本科生毕业设计(论文)撰写规范与模板

东北大学秦皇岛分校本科生毕业设计（论文）撰写规范与模板毕业设计（论文）是培养学生知识、能力和素质的重要环节，撰写本科毕业设计（论文）是人才能力培养的重要体现，为确保毕业设计论文撰写质量，特制定东北大学秦皇岛分校本科生毕业设计（论文）撰写规范及模板。

在遵照本规范的前提下，各学院还可根据不同专业特点对相关专业的毕业设计（论文）撰写格式提出更为具体的要求。

（一）字体和字号要求论文题目：二号黑体各章标题：三号黑体各节各级标题：小四号黑体正文中中文内容：小四号宋体正文中英文、数字内容：小四号，Times New Roman体中文摘要、结论、参考文献标题：三号黑体中文摘要、结论、参考文献内容：小四号宋体英文摘要、结论、参考文献标题：粗体三号，Times New Roman体英文摘要、结论、参考文献内容：小四号，Times New Roman体中文关键词标题：小四号黑体中文关键词：小四号宋体英文关键词标题：粗体小四号，Times New Roman体英文关键词：小四号，Times New Roman体目录标题：三号黑体目录中各章标题（含结论、参考文献、致小四号黑体谢、附录标题）：目录中其他中文内容：小四号宋体目录中其他英文、数字内容：小四号，Times New Roman体页码：五号，Times New Roman体（二）页面设置要求1. 页眉顶端距离设置为1.5cm，底端距离为1.75cm；页眉“东北大学秦皇岛分校本科生毕业设计（论文）”黑体，四号，居中。

2. 论文奇数页上边距：30mm，下边距：25mm，左边距：30mm，右边距：20mm。

3. 论文偶数页上边距：30mm，下边距：25mm，左边距：20mm，右边距：30mm。

4. 行间距为1.5倍行距。

（三）页码编排与排版要求1. 页码位于页脚中间。

2. 摘要和目录页码用罗马数字单独编排。

3. 论文页码从绪论部分开始至附录，用阿拉伯数字连续编排。

4. 绪论首页必须在奇数页码上，各章之间加分页符。

东北大学继续教育学院毕业设计（论文）工作规范

东北大学继续教育学院毕业设计（论文）工作规范第一篇：东北大学继续教育学院毕业设计(论文)工作规范东北大学成人高等教育本科生毕业设计(论文)工作规范毕业设计(论文)是培养学生知识、能力和素质的重要环节，是进行综合训练的教学阶段。

做好毕业设计(论文)对培养学生的工程意识、开拓精神、创新能力、科学作风、综合素质都具有重要作用。

为确保毕业设计(论文)的质量，特制定东北大学继续教育学院本科生毕业设计(论文)工作规范。

一、指导思想通过毕业设计(论文)工作使大学生达到基本知识、基础理论、基本技能(三基)和运用知识能力、文献检索能力、实验测试能力、计算机应用能力、制图能力(六个能力)以及文化素质、思想品德素质、业务素质(三个素质)的训练，培养学生运用所学的专业知识和技术，研究、解决本专业实际问题的能力。

同时，毕业设计(论文)工作是大学教育的综合训练，也是对教育质量的检验。

二、选题选题是对毕业设计(论文)工作范围进行专业确定的环节。

1．毕业设计(论文)的选题要按照所学专业培养目标确定。

围绕本专业、学科选择有一定理论与实用价值的具有运用课程知识、能力训练的题目；2．选题尽可能与科研、生产相结合。

工科类专业以毕业设计为主；文理科类专业毕业论文要理论与实践相结合，有实用价值；3．毕业设计(论文)的题目要坚持每人一题。

指导教师可将大而难的题目分解成若干个子题目，作为由学生完成的课题；4．对于与往届重复的课题，严禁将往届毕业设计(论文)借给学生参考，防止出现抄袭现象；5．毕业设计(论文)的课题须由研究所审核，在审核批准后下达任务书；6．无任务书不能进行毕业设计(论文)工作。

三、对毕业设计(论文)的基本要求1．要求学生能够在毕业设计(论文)中应用基本知识、基础理论和基本技能去分析问题和解决问题，并表现出一定的工程设计和科学研究能力；2．学生能独立检索文献资料并恰当运用；3．学生能进行本专业范围内的实验、测试、计算、绘图、设计、计算机应用等综合训练；4．毕业设计(论文)的理论依据要充分，数据准确，公式推导正确。

东北大学本科生毕业设计(论文)格式要求

2.4 总体参数的确定···········································································································7
第3章执行机构设计·································································································10
底片自动取送机械系统设计
作者姓名：刘刚
指导教师：柳洪义教授
单位名称：机械工程与自动化
专业名称：机械工程与自动化
东北大学
2005年6月
Film-catching-and-delivering system design
by Liu Gang
Supervisor: Professor Liu Hong Yi
附录········································································································································40
第1章绪论
1.1 设计背景
This design aims to meet this requirement. The system can catch and carry the film automatically in the environment of mass of ozone. So it improves the work efficiency greatly . The mechanical structure of this system can be divided into two parts, the upside part as carrying department and the underside as automatic catching department. Of them , the motor drives two active wheels through the decelerating system. Then, the active wheel pull the whole system to move forward or backward on the preconcerted tramroad. The automatic catching department can safely realize catching film and it is composed of two special holding structure jointed by one mechanical arm, it can catch the film safely. The catching department is a new combination of the mechanism and electron equipments, it realizes the catching and loading action by the contraction and extension of the electromagnets. So it can catch and load the film very fast and frequently.

东北大学毕业设计(论文)-模板

This manual is divided into two parts: the first part, the blast furnace workshop design; the second part, translation.
The first part is divided into 10 chapters, the content including comprehensive calculation, design of blast furnace, raw material system, top charging equipment, air supply system (blast system), blast furnace gas system, slag-iron management system, injection fuel system, blast furnace layout, and environmental protection.
本设计主要的任务是：设计一座年产480万吨制钢生铁和40万吨铸造生铁的炼铁厂。根据国内外大型高炉先进生产技术指标，确定的主要技术经济指标：利用系数2.3，焦比315kg，煤比180kg，热风温度1200℃，富氧3%。炼铁厂设计主体包括两座33003的高炉，以及每座高炉对应的四座新日铁外燃式热风炉，一座重力除尘器及其它附属设备。在设计上，采用国内外先进技术，如高风温，喷吹煤粉，干法除尘，环形出铁场等。另外，在炉前设置了除烟罩和其他除尘设备，在噪音大的地方安装消音器，以改善炼铁厂的环境，减少对环境的污染。本设计预计可实现高产、优质、低耗、长寿和环保的综合目标。
3.孙志礼，冷兴聚，魏延刚等．机械设计[M]，沈阳：东北大学出版社，2000，32-33．

东北大学硕士学位论文排版打印格式

东北大学硕士学位论文排版打印格式1. 引言依据中华人民共和国《科学技术报告、学位论文和学术论文的编写格式》和东北大学学位论文格式改编，专为我校申请硕士、博士学位人员撰写打印论文时使用。

本格式自发布日起实行。

2. 学位论文主要部分学位论文主要部分由前头部分、主体部分和结尾部分（只限必要时采用）组成。

2.1 前头部分（1）封面（2）扉页——题名页（中、英两种）（4）声明（独创性声明）（3）摘要（中、英两种文字）（5）目录（6）插图和附表清单（只限必要时）（7）缩略字、缩写词、符号、单位表（只限必要时）（8）名词术语注释表（只限必要时）2.2 主体部分（1）绪论（前言、引言、绪言）（2）正文（3）讨论、结论和建议2.3 结尾部分（只限必要时采用）（1）参考文献（2）致谢（3）攻读学位期间发表的论著、获奖情况及发明专利等项。

（4）作者从事科学研究和学习经历的简历（5）可供参考的文献题录（只限必要时采用）（6）索引（只限必要时采用）3. 版式纸张大小：纸的尺寸为标准A4复印纸（210mm×297mm）。

版芯（打印尺寸）：160mm×247mm（不包括页眉行、页码行）。

正文字体字号：小4号宋体，全文统一。

每页30～35行，每行35～38字。

装订：双面打印印刷，沿长边装订。

页码：页码用阿拉伯数字连续编页，字号与正文字体相同，页底居中，数字两侧用圆点或一字横线修饰，如·3·或－3－。

页眉：自摘要页起加页眉，眉体可用单线或双线（二等线、文武线），页眉说明5号楷体，左端“东北大学硕士、博士学位论文”，右端“章号章题”。

封面：东北大学研究生（博士或硕士）学位论文标准封面（双A4）。

4. 体例4.1 标题论文正文按章、条、款、项分级，在不同级的章、条、款、项阿拉伯数字编号之间用点“.”（半角实心下圆点）相隔，最末级编号之后不加点。

排版格式见表4.1。

此分级编号法只分至第四级。

再分可用（1）、（2）……；（a）、（b）……等。

东北大学毕业-论文设计要求

目录一、内容总体要求 (3)（一）引言 (3)（二）论文的类型 (3)（三）毕业设计的选题 (3)（四）论文的写作 (4)二、编写格式 (5)（一）封面 (5)1、论文题目 (6)2、作者姓名 (6)3、指导教师姓名 (6)4、论文封面日期 (6)（二）中文题名页 (6)1、题目 (6)2、姓名 (6)3、学校与日期 (7)（三）英文题名页 (7)1、题目 (7)2、姓名 (7)3、职称 (7)4、学校与日期 (7)（四）毕业设计论文（任务书） (7)1、毕业设计（论文）题目 (7)2、基本内容 (7)3、毕业设计（论文）专题部分 (8)4、学生接受毕业设计（论文）题目日期 (8)（五）中文摘要 (8)1、中文题目 (8)2、摘要 (8)3、摘要内容 (8)4、关键词 (8)5、关键词内容 (8)6、关键词的选取 (8)7、摘要内容的编写 (9)（六）英文摘要 (9)1、题目 (9)2、摘要 (9)3、格式 (9)4、关键词 (9)（七）目录 (9)1、目录 (10)2、索引条目 (10)3、各节 (10)（八）正文 (10)1、标题 (11)2、正文 (11)3、节 (11)4、小节 (12)5、正文编号 (12)6、图 (12)7、表 (12)8、程序代码 (13)9、结论 (13)（九）参考文献 (13)（十）结束语（致谢） (14)三、其他要求 (14)1、打印 (14)2、页码编排 (14)3、页眉设置 (14)4、装订 (14)东北大学软件学院毕业设计（论文）撰写与排版规范一、内容总体要求（一）引言毕业设计（论文）是学生在校学习的最后阶段，是培养学生综合运用所学知识，发现、提出、分析和解决实际问题，锻炼实践能力的重要环节，是对学生实际工作能力的系统训练和考察过程。

毕业设计（论文，下称论文）是学生在教师指导下，对所从事工作和取得成果的完整表述，是学生毕业及学位资格认定的重要依据。

论文的撰写是学生基本能力训练的过程，应当符合国家及有关行业（部门）指定的有关标准，符合汉语语言规范。

论文撰写与排版规范

东北大学材料科学与工程学院硕士、博士学位论文撰写与版式规范1. 引言依据中华人民共和国《科学技术报告、学位论文和学术论文的编写格式》和东北大学学位论文格式改编，专为我院申请硕士、博士学位人员撰写、打印论文时使用。

本规范自发布日起实行。

2. 学位论文结构组成学位论文由前头部分、主体部分和结尾部分组成。

（5）作者简历3. 学位论文内容要求3.1 题目题目应以简明的词语，恰当、准确、科学地反映论文最重要的内容,一般不超过25字，应中英文对照。

题目通常由名词性短语构成，不能含有标点符号；应尽量避免使用不常用的缩略词、字符、代号和公式等。

3.2 摘要与关键词3.2.1 摘要摘要是论文内容的高度概括，应具有独立性和自含性，即不阅读论文的全文，就能通过摘要了解整个论文的主要信息。

摘要应包括本论文研究的目的、理论与实际意义、主要研究内容、实验方法，重点是研究结果和结论。

摘要的内容要完整、客观、准确，应按层次逐段简要写出。

避免将摘要写成目录式的内容介绍，避免主观性的评价意见，避免对背景、目的、意义、概念和一般性（常识性）理论过多叙述。

摘要中尽量不使用第一人称，采用“分析了……原因”、“认为……”、“对……进行了探讨”等记述方法进行描述。

摘要需采用规范的名词术语（包括地名、机构名和人名）。

对个别新术语或无中文译文的术语，可用外文或在中文译文后加括号注明外文。

摘要中不宜使用图表，尽量少用公式、化学结构式、非常用的缩写词和非公知公用的符号与术语，不标注引用文献编号。

东北大学论文格式(硕士)

本格式自发布日起实行。

2. 学位论文主要部分学位论文主要部分由前头部分、主体部分和结尾部分（只限必要时采用）组成。

版芯（打印尺寸）：160mm×247mm（不包括页眉行、页码行）。

正文字体字号：小4号宋体，全文统一。

每页30～35行，每行35～38字。

装订：双面打印印刷，沿长边装订。

页码：页码用阿拉伯数字连续编页，字号与正文字体相同，页底居中，数字两侧用圆点或一字横线修饰，如·3·或－3－。

页眉：自摘要页起加页眉，眉体可用单线或双线（二等线、文武线），页眉说明5号楷体，左端“东北大学硕士、博士学位论文”，右端“章号章题”。

封面：东北大学研究生（博士或硕士）学位论文标准封面（双A4）。

排版格式见表4.1。

此分级编号法只分至第四级。

再分可用（1）、（2）……；（a）、（b）……等。

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

东北大学东软信息学院外文资料和译文格式要求一、译文必须采用计算机输入、打印，幅面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。

论文正文格式及字体要求

论文正文格式及字体要求在撰写论文时，正确的正文格式和字体要求不仅能使论文看起来规范、整洁，还能提高阅读的舒适度和效率。

下面将详细介绍论文正文的格式及字体方面的要求。

一、页面设置首先，页面的大小和布局对于论文的整体呈现非常重要。

一般来说，使用 A4 纸张大小，页边距通常设置为上下 254 厘米，左右 317 厘米。

页面的方向通常为纵向，但如果图表较宽，也可以在特定部分设置为横向。

二、字体和字号字体的选择应该清晰易读，常见的字体如宋体、黑体、楷体等都可以使用。

对于正文部分，一般使用宋体，字号为小四。

标题部分的字号则根据标题的级别有所不同。

一级标题，通常使用小三号字，加粗。

二级标题使用四号字，加粗。

三级标题使用小四号字，加粗。

三、行间距和段落间距行间距一般设置为 15 倍行距，这样可以使文字排列不显得过于紧凑，方便阅读和批注。

段落间距方面，段前和段后可以分别设置为 05 行，以使段落之间有一定的分隔，增强文章的层次感。

四、段落格式每段开头应该空两个字符的位置，这是中文写作的常见规范。

段落应该保持相对的独立性和完整性，一个段落表达一个相对完整的意思。

五、标点符号标点符号的使用要正确规范。

逗号用于分隔句子中的成分，句号表示句子的结束。

分号用于分隔具有一定逻辑关系的并列分句。

引号用于引用他人的话语或特定的词语。

六、数字和公式数字的书写应该统一，如阿拉伯数字和汉字数字的使用要遵循相应的规则。

对于公式，应该使用公式编辑器进行编辑，使其格式整齐、清晰。

七、图表图表应该有清晰的标题和编号，图表中的文字大小和字体要与正文协调一致。

图表的位置应该根据其与正文的关联程度进行合理安排，可以在文中提及的位置插入，也可以集中放在论文的末尾。

八、引用和参考文献在正文中引用他人的观点、数据或研究成果时，要使用正确的引用格式，如脚注或尾注。

参考文献的罗列应该按照一定的格式，如作者姓名、文献题目、出版信息等，并且要按照字母顺序或出版时间顺序进行排列。

东北大学论文要求.doc(具体格式)

关于论文内容及格式说明电子版及手印稿顺序如下:1.毕业论文封面2．毕业设计(论文)申请表(见附录)3．毕业设计(论文)任务书(见附录)4．毕业设计(论文)指导教师意见书(见附录)5．毕业设计(论文)评阅教师意见书(见附录)6．毕业设计(论文)答辩成绩评定书(见附录)7．中文摘要和关键词8．英文摘要和关键词9．目录10．正文11．注释和引文（可选）12．参考文献13．致谢说明：毕业设计(论文)用纸：B5标准白纸，(绘图除外)。

毕业论文或设计说明书用计算机打印。

打印时每页36行，每行34字。

形成PPT格式的内容演示时间是5—6分钟。

【摘要】（黑体，二号，居左，加粗）摘要内容宋体小四号……【关键词】(3~5个，使用分号进行分隔，宋体小四号)【Abstract】(字体用WORD系统中的Times New Roman体，二号，加粗)英文标题（居中，Times New Roman体，二号）英文摘要内容（Times New Roman体，小四号，首行缩进2字符）……【Key W ords】（Times New Roman体，小四号，使用分号进行分隔）目录（黑体，二号，自动生成）第1章引言 (1)1.1 题目 (2)1.1.1 题目 (3)第2章（同上，须全文统一）……第N章结束语……………………………………………………n-1 参考文献……………………………………………………………n 致谢…………………………………………………………………m第1章引言（黑体二号，占3行，一级标题，居中）1.1 题目（黑体三号，占2行，二级标题，居左，须全文统一）1.1.1 题目（黑体四号，占2行，三级标题，居左，须全文统一）论文正文内容（宋体小四号，首行缩进2字符，须全文统一）（1）……（如有四级题目使用此形式，下同，须全文统一）从正文（本页开始插入页码）第2章题目（黑体二号，占3行，一级标题，居中，每一章须另起一页）2.1 题目（黑体三号，占2行，二级标题，居左）2.1.1 题目（黑体四号，占2行，三级标题，居左）论文正文内容（宋体小四号，首行缩进2字符）……第N章结束语……参考文献（黑体二号，占3行，一级标题，居中）参考文献采用顺序号编号体系，格式如下：(1) 期刊文献：[序号]作者.文献标题[J].刊名，年，卷(期)：起止页码.(2) 著作：[序号]作者.书名[M].出版城市：出版社，出版年：起止页码.(3) 学位论文：[序号]作者.论文名[D].保存地(城市名)：保存单位，年份.(4) 专利：[序号]专利所有者.专利名称：专利国别，专利号[P].公告日期或公开日期.(5) 标准：[序号]主要责任者.标准号及标准名称[S].出版地：出版者，出版年：引文页码.(6) 论文集：[序号]论文作者.论文题名[文献类型标志]//文集责任者.论文题集名.出版地：出版者，出版年：起止页码.(7) 报纸中析出的文献：[序号]责任者.文献题名[N].报纸名称，出版日期[版次].(8) 电子文献：[序号]主要责任者.题名[文献类型标志/文献载体标志].出版地：出版者，出版年[引用日期].获取和访问路径.文献类型和标志代码：普通图书： M ；会议录： C ；汇编： G；报纸：N ；期刊：J；学位论文：D；报告： R ；标准：S；专利： P；数据库：DB；计算机程序： CP；电子公告： EB；电子文件载体和标志代码：磁带(magnetic tape) MT；磁盘(disk) ， DK ；光盘(CD-ROM)：CD ；联机网络(online)： OL。

【免费下载】东北大学论文格式

底片自动取送机械系统设计作者姓名：刘刚指导教师：柳洪义教授单位名称：机械工程与自动化专业名称：机械工程与自动化东北大学2005年6月Film-catching-and-delivering system designby Liu GangSupervisor: Professor Liu Hong YiNortheastern UniversityJune 2005毕业设计（论文）任务书毕业设计（论文）题目：设计(论文)的基本内容：毕业设计（论文）专题部分：题目：设计或论文专题的基本内容：学生接受毕业设计（论文）题目日期第周指导教师签字：年月日底片自动取送机械系统设计摘要随着科技的发展，高能射线探测被广泛的应用到固体火箭发动机的质量检测中。

在这个探测过程中，空气会被电离产生大量的臭氧气体。

过量的臭氧气体对人体有很大的伤害，所以人不能过早的进入检测实验室中去取换接收检测信息的底片，这势必会影响工作效率。

为了提高工作效率，取送接受检测信息底片的工作必须由机械系统自动完成。

本设计就是针对这种需求所进行的。

该系统可以在有大量臭氧存在的环境下自动夹取、运送底片，不需要等到臭氧从检测室排除，所以大大地提高了工作效率。

……………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………。

关键词：底片取送系统，运送小车，夹持器东北大学毕业设计（论文）AbstractFilm-catching-and-delivering system designAbstractWith the development of technology, the hign-energy-radial fault detection method has been largely used in the quantity examination for the solid rocket engine. However, in the detective process, mass of ozone gas might be generated by radial, excessive quantity of which means great harm to the people around. For sake of this, people are constrained from going into the room to get information films too early, and this will greatly reduce the work efficiency. In a word, in order to improve the work efficiency, catching and carrying the films should be completed by mechanical systems automatically.This design aims to meet this requirement. The system can catch and carry the film automatically in the environment of mass of ozone. So it improves the work efficiency greatly . The mechanical structure of this system can be divided into two parts, the upside part as carrying department and the underside as automatic catching department. Of them , the motor drives two active wheels through the decelerating system. Then, the active wheel pull the whole system to move forward or backward on the preconcerted tramroad. The automatic catching department can safely realize catching film and it is composed of two special holding structure jointed by one mechanical arm, it can catch the film safely. The catching department is a new combination of the mechanism and electron equipments, it realizes the catching and loading action by the contraction and extension of the electromagnets. So it can catch and load the film very fast and frequently.……………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………………….Key words: Film-catching-and-delivering system，Delivering vehicles，catching structure目录任务书..................................................................................................................................i中文摘要. (ii)ABSTRACT (iii)第1章绪论 (1)1.1 设计背景 (1)1.2 系统简要介绍 (1)第2章机械系统总体设计 (3)2.1 机械系统的功能原理设计 (3)2.2 结构总体设计···············································································································42.3 总体布置设计 (5)2.4 总体参数的确定 (7)第3章执行机构设计 (10)3.1 执行系统的组成、功能及分类 (10)3.2 执行系统的设计 (10)3.2.1 底片夹取部分的设计 (11)第N章结论 (15)参考文献 (38)结束语（致谢） (39)附录 (40)第1章绪论1.1 设计背景随着时代的发展，导弹在现代国防战争中所占的地位越来越重要。

东北大学毕业论文格式要求(紫色字体为力学专业要求)

撰写论文的一些经验和附加说明1.撰写论文前，要先设置【页边距】和【纸张大小】，然后设置【样式】3. 关于【分隔符】的使用每一个独立的部分（比如中文摘要和英文摘要就属于两个独立部分）或者每一章之后都要使用分隔符，而且应该使用【分节符（下一页）】这样每一章就能另起一页，而且可以设置不同的页眉。

使用【回车若干次来换页】或【分页符】或【分节符（连续）】，都是不规范不合理的操作。

4. 关于页眉每一章的页眉，右侧的章名称是不同的，在设置页眉时，要取消【连接前一节的页眉】这样就可以单独设置某一章的页眉了，不会影响前一章的页眉。

另外，封面及任务书这几页上面的【页眉横线】去掉方法：页眉横线实际上是一个边框，先把光标放在页眉处，【段落】→【边框底纹】→选择【无边框】即可去掉这条线。

5.关于【居中】的使用文中一些内容需要【居中】，比如图或表。

使用时需注意：看看是“无缩进居中”还是“缩进两个字符后居中”，这也是居中后看起来还不是在正中间的原因。

把【标尺】拉到左端即可“无缩进居中”，看上去完全在中间。

6.目录中的页码对齐两个方法：段落对齐方式，使用“分散对齐”即可，这种方法适用于：在自动生成目录基础上有手动修改的情况。

或者完全使用自动生成的目录，在生成目录之前，按照目录格式要求把：字体、字号、行距，还有标题和页码之间的“点”，把这些都提前设置好再生成目录即可。

7.大部分人的word默认的都是有一定间距的，但是也有少数人的word默认的是紧贴着，原因在于没有设置网格。

把“页面设置”中的的“无网格（N）”取消，即可解决。

8.正常文字段落，使用1.5行距，当段落中存在用公式编辑器编辑的式子或字母时，行距就会自动变宽，行距看起来有的宽有的窄。

处理方法为：对于有“式子”的段落，设置行距为“固定行距23.5磅”，这样看起来跟1.5倍行距一致。

，后面紧跟一个空白页，无页眉页脚。

每一章从奇数页开始，若最后一页为空白页（即空白页为偶数页），则该页页眉同本章其它页，页码也照常连续。

东北大学本科毕业设计(论文)格式要求

（2）毕业设计（论文）内容打印要求
标题要求：论文主体部分按章ቤተ መጻሕፍቲ ባይዱ节、条、项分级，在不同级的章、节、条、项
阿拉伯数字编号之间用“.”（半角实心下圆点）相隔，最末级编号之后不加点。
排版格式见下表:
标题字号字体
格式
举例
第一级二号黑体居中，单倍行距, 第 1 章 XXX
(章)
段后 1 行
第二级三号黑体居左，单倍行距 1.1 XXXXXX
/pub/980810-2.html, 1998-08-16 （b）结束语（致谢）：“结束语”标题采用一级标题格式排版。中文字体采用小四号宋体，1.5 倍行距。外文、数字字号与同行汉字字号相同，字体用“Times New Roman”字体，1.5 倍行距。（c）附录：附录中的内容要与正文内容分开，用阿拉伯数字编号，须在数码前加上附录序码。如：图 A.1，式（B.2），表 C.3 等。外文翻译部分标题采用一级标题排版，翻译内容中文采用小四号宋体，英文采用小四号“Times New Roman” 字体，1.5 倍行距。
本科毕业设计（论文）格式要求
一、对毕业设计(论文)的基本要求
开题报告内容应包括：（1）选题的背景、目的和意义；（2）设计（论文）应用的原理和理论依据；（3）设计（论文）方案可行性分析；（4）预期成果；（5）参考文献。
1、学生能够运用一门外语阅读、翻译本专业外文资料，至少翻译一篇外文文献，译文汉字字数不少于 4000 字。
(节)
第三级四号黑体居左，单倍行距 1.1.1 XXXXXX
(条)
第四级小四号黑使用不同编号，如 (a)(b)(c)…；（1）（2）（3）…等
(项)
体
（3）介于标题要求下的其它要求： A．前置部分

论文正文格式及字体要求

论文正文格式及字体要求在撰写论文时，规范的正文格式和合适的字体选择不仅能够提升论文的可读性，还能展现作者的严谨态度。

以下将详细介绍论文正文格式及字体的要求，帮助您更好地完成论文写作。

一、页面设置首先，页面的布局对于整体的视觉效果和阅读体验至关重要。

一般来说，使用 A4 纸张大小，页面上下左右的边距通常设置为 25 厘米。

行间距可选择 15 倍或 2 倍行距，这样能使文字看起来更加舒适，不会显得过于拥挤。

二、字体和字号1、中文字体正文部分：通常使用宋体，字号为小四。

标题部分：根据标题的层级，选择不同的字号和字体。

一级标题可以使用黑体三号，二级标题使用黑体四号，三级标题使用黑体小四。

2、英文字体正文部分：一般使用 Times New Roman 字体。

标题部分：与中文字体的要求类似，根据层级调整字号和字体。

三、段落格式1、首行缩进每段开头应缩进两个字符，这样可以清晰地区分段落。

2、对齐方式正文通常采用两端对齐的方式，使页面看起来更加整齐。

3、段落间距段与段之间可以设置适当的间距，比如段前 05 行或 1 行，段后 05 行，增强段落的层次感。

四、标题格式1、层级分明论文标题应分为多个层级，如一级标题、二级标题、三级标题等，以便清晰地组织文章结构。

每个层级的标题都应有明确的逻辑顺序和重要性区分。

2、编号方式可以使用阿拉伯数字进行编号，如一、（一）、1、（1）等，使标题的层次一目了然。

五、标点符号1、正确使用严格按照标点符号的使用规则，避免错用、滥用或漏用标点。

例如，逗号用于分隔句子中的成分，句号表示句子的结束，分号用于分隔并列的分句等。

2、统一规范在整篇论文中，标点符号的使用应保持统一的风格和规范。

六、图表格式1、图表编号图表应按顺序编号，如“图1”“表1”等。

2、标题图表应有简洁明了的标题，准确描述图表的内容。

3、字体和字号图表中的文字字体和字号应与正文保持一致或协调。

七、数字和公式1、数字格式对于阿拉伯数字和汉字数字的使用，应遵循相应的规范。

论文正文格式及字体要求

论文正文格式及字体要求在撰写论文时，正文的格式和字体要求是非常重要的，它不仅能够使论文看起来更加规范、整洁，还能提高阅读的舒适度和便利性。

下面我们就来详细了解一下论文正文的格式及字体要求。

一、页面设置页面设置包括纸张大小、页边距、行距等方面。

一般来说，论文使用 A4 纸张，上下页边距为 254 厘米，左右页边距为 317 厘米。

行距通常设置为 15 倍行距或者 2 倍行距，这样可以使正文看起来更加清晰易读。

二、字体和字号1、中文正文一般使用宋体，字号为小四。

标题部分可以根据层级的不同使用不同的字号和字体，比如一级标题使用黑体三号，二级标题使用黑体四号，三级标题使用黑体小四号。

2、英文正文通常使用 Times New Roman 字体。

字号与中文正文相同，即正文为小四号。

三、段落格式1、段落缩进段落开头一般缩进两个字符，可以通过“段落”设置中的“特殊格式”选择“首行缩进”来实现。

2、对齐方式正文一般采用两端对齐的方式，这样可以使页面看起来更加整齐。

3、分段论文正文应该合理分段，每段的内容不宜过长或过短。

一般来说，一个段落围绕一个主题展开，长度控制在 5 8 行为宜。

四、标点符号1、标点使用要规范正确使用逗号、句号、分号、冒号等标点符号，避免出现标点乱用的情况。

例如，列举时要用逗号分隔，完整句子结束要用句号，并列分句之间要用分号等。

2、标点符号的字体标点符号的字体应与正文的字体保持一致。

五、数字和公式1、数字数字的书写要规范，如整数、小数、百分数等的表示方法要准确。

对于较大的数字，可以采用千分位分隔符，增加数字的可读性。

2、公式公式应该使用专门的公式编辑器进行编辑，如 MathType 等。

公式的编号应该按照章节顺序进行，如“（1 1）”、“（2 1）”等，编号右对齐。

六、图表1、图表的编号图表应该按照在正文中出现的顺序进行编号，如“图1”、“表1”等。

编号和标题应该位于图表的上方或下方，字体和字号与正文相同。

东北大学本科论文撰写须知及模板

毕业论文撰写须知1.毕业论文正文，用B5复印纸，按长：18.2cm，高25.7cm页面设计，每页20行，每行30字。

页边距为上：3cm；下：2cm；左：2.2cm；右：1.8cm。

页眉：1.8cm；页脚：1.4cm。

页眉内容为“东北大学继续教育学院毕业设计（论文）’’, 用四号黑体字，单倍行距、双实线。

论文封皮使用东北大学继续教育学院毕业设计（论文）封皮，封皮上各项内容须计算机打印，封皮打印参照论文封皮打印模板。

或使用根据东北大学毕业论文封皮模板打印的封皮，打印封皮需使用浅绿色，或浅灰色180克封皮纸。

外封皮裁剪与论文页面大小一致。

2. 正文用四号仿宋体；一级标题（章、目录、前言、参考文献）用三号宋体字；二级标题（节）用四号黑体字；三级标题（节下标题）用四号楷体字；图表说明用小五号宋体字。

3. 章、节的编号一律用阿拉伯数字逐级编号，一级标题（章）为“1.x x x”；二级标题（节）为“1.1 x x x”；三级标题（节下标题）为“1.1.1 x x x”。

编号不超过三级。

4. 论文正文前要有前言（或内容提要）、目录，正文后要有结束语、参考文献。

“目录”中章、节要标注页码；“内容提要”中要有关键词；“参考文献”中引用书刊要注明书名、作（编）者、出版社、出版时间及版本；引用文章要注明作者、期刊名称、期号、所在页数。

5. 论文前言、目录及参考文献均各占一页；正文逢一级标题另起一页；标题和正文之间要留有适应空行。

6. 论文装订顺序为：（1）封面，（2）任务书，（3）指导教师评语，（4）指导记录，（5）开题报告，（6）目录，（7）前言（内容提要），（8）正文，（9）参考文献，（10）封底。

装订方式为左侧胶装。

论文文字版面质量是答辩成绩的重要参考因素，粗糙者将影响答辩成绩，不符合要求者不能参加答辩。

开题报告的内容应包括：1．课题主要研究内容；2．课题的研究意义、国内外现状；3．指出课题难点和拟解决的关键问题；拟采取的研究方法及其可行性等；4．按以下格式列出参考文献：[1] 作者、文章题目、期刊名、年份、期数、页码（期刊杂志类）；[2] 作者、书名、出版单位、年份、页码（图书类）；[3] 作者、文章名、网址、日期（网上资料类）。

东北大学高等教育自学考试公司管理专业毕业论文要求与实施办法.

东北大学高等教育自学考试公司管理专业毕业论文要求与实施办法说明1.为了不断提高教学水平和学生的综合素质，特制定本办法。

2.学生撰写论文和指导老师指导论文之前，请务必认真阅读本实施办法。

一、论文写作的目的意义论文写作，是全部教学活动的最后、而且又是最重要的一个环节。

因为这个阶段主要靠学生的自觉性、主动性和创造性；而这个阶段学生比较分散，所以，这个环节又是最难的环节。

（一）论文写作是所学知识综合运用的创新活动1.论文写作是将所学知识在实践中理论联系实际的综合运用；2. 论文写作是对所学多门课程知识的融会贯通、综合运用的过程，本身就是一种创新活动。

（二）论文写作是多种能力的综合训练与提高论文的写作过程，至少能综合训练学生的六种能力：⑴调查研究、分析问题和解决问题的能力；⑵通过各种途径与渠道查阅、收集资料、文献检索、信息的综合整理与归纳能力；⑶问题研究、方案设计、绘制图表的能力；⑷撰写论文和说明书的文字表达能力；⑸计算机及外语应用能力；⑹提高学生的文化素质、思想品德素质、业务素质、做人做事的能力。

二、论文的写作过程步骤及内容（一）确定论文的题目1.论文选题的原则⑴题目应符合本专业（公司管理）的要求；⑵选题尽可能来自企业实际，且以应用型为主。

不提倡选择纯理论性的题目；⑶题目尽量微观，不要太宏观；题目的界定应以保证论文有适当的工作量为宜。

⑷以政府机关、社会团体、科研院所以及其他事业单位为研究对象的选题，请在论文中指明运用了哪些公司管理专业的所学理论。

2. 论文选题注意的问题⑴论文题目中不能使用诸如：论……；试论……；谈……；试谈……；浅谈……；浅析……；浅议……；……分析等等。

2.学术论文的题目不能使用总结报告式、标语口号式题目；不能使用一般性杂志发表的文章题目。

3.确定题目的方法从学生的实际出发，由指导老师和学生共同商定。

论文的参考题目附后。

㈡调查研究，文献检索，查阅收集资料1.到所研究的单位实地调查、查阅收集资料到所研究的单位了解收集：单位简介、组织机构情况、职工队伍状况、企业文化状况、生产经营状况、企业规章制度、经验总结等资料。

论文格式要求

论文格式要求
论文的格式要求如下：
一、题目
1、字体：黑体，加粗，三号
2、段落：
（1）行距：单倍行距
（2）段前：24磅
段后：18磅
（3）对齐方式：居中对齐（4）大纲级别：正文文本二、摘要
1、摘要两个字的格式：黑体，常规，小四，中间空两格
2、摘要内容的格式：
a、字体：宋体，常规，小四
b、段落：
（1）行距：单倍行距
（2）段前：磅
段后：磅
（3）对齐方式：两端对齐（4）大纲级别：正文文本三、关键词
1、关键词的格式：黑体，常规，小四
2、关键词内容的格式：宋体，常规，小四四、目录
1、目录：黑体，加粗，三号
2、前言和一级提纲：黑体，常规，四号
3、二级提纲
字体：宋体，常规，小四首行缩进：2字符
4、三级提纲
字体：宋体，常规，小四首行缩进：4字符
段落：单倍行距
五、前言（中间空四格）1、字体：黑体，常规，三号2、段落：单倍行距
六、正文
1、一级提纲
字体：黑体，加粗，三号段落：对齐方式：居中对齐
段前：24磅
段后：18磅
行距：单倍行距
大纲级别：1级提纲2、二级提纲
字体：宋体，加粗，四号段落：对齐方式：两端对齐
段前：24磅
段后：6磅
行距：单倍行距
纲目级别：2级提纲3、三级提纲
字体：黑体，常规，小四段落：对齐方式：两头对齐段前：12磅
段后：6磅
行距：单倍行距
大纲级别：3级提纲4、正文内容
（1）文字
字体：宋体，常规，小四段落：对齐方式：两头对齐段前：磅
段后：磅
行距：单倍行距。

东北大学 论文格式要求

东北大学秦皇岛分校本科生毕业设计(论文)撰写规范

东北大学秦皇岛分校本科生毕业设计(论文)撰写规范与模板

东北大学继续教育学院毕业设计（论文）工作规范

东北大学本科生毕业设计(论文)格式要求

东北大学毕业设计(论文)-模板

东北大学硕士学位论文排版打印格式

东北大学毕业-论文设计要求

论文撰写与排版规范

东北大学论文格式(硕士)

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

论文正文格式及字体要求

东北大学论文要求.doc(具体格式)

【免费下载】东北大学论文格式

东北大学毕业论文格式要求(紫色字体为力学专业要求)

东北大学本科毕业设计(论文)格式要求

论文正文格式及字体要求

论文正文格式及字体要求

东北大学本科论文撰写须知及模板

东北大学高等教育自学考试公司管理专业毕业论文要求与实施办法.

论文格式要求

东北大学论文格式要求