摘要写法

Quantifying Path Exploration in the Internet (From IEEE Transaction on Networks)
Pay attention to PUNCTUATION and GRAMMAR
Abstract—Previous measurement studies have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem. However, existing measurements were conducted only over a small number of testing prefixes.
In this paper we present our measurement results that identify BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy.。

. Furthermore, our data shows that the convergence time of route fail-over events is similar to that of new route announcements, and is significantly shorter than that of route failures.
时态：一般用现在时，但是提到过去的研究工作时用完成式或者过去式。

1．并列成分和并列句的使用。

2．从句：最常用宾语从句、定语从句that, which
3. 常用动词：examine, study, analyze, survey, conduct
show, present, demonstrate, illustrate (说明，如experiments illustrate ….) give
be
propose, put forward
prove, suggest
implement, simulate
4. 主语：常用被动语态;
the thesis, the paper;
We
改错练习（1）
随着计算机硬件尤其是图形扫描设备和图形处理硬件性价比的提高，以及几何造型软件的普及，越来越多的三维模型在各个领域中得到了广泛地应用。

Improved modeling tools and scanning devices are making the acquisition of 3D models easier and lower expensive. 3D graphics hardware and CPUs have become fast cheap enough that 3D data can be processed and displayed more quickly on PCs. It leads to high demands for 3D models from a wide range of sources.
语法：状语，＋句子。

只是状语有点长。

With the improvement of high performance-price ratio of hardware, especially the graphical scanning and processing hardware, and the popularity of Geometry Modeling software, more and more 3-D models are widely used in various fields.
在充分阅读相关文献资料的基础之上，对三维模型的形状特征提取技术进行了实现研究，主要研究工作和创新点如下：
The full reading of the relevant literature on the basis of information on the shape of three-dimensional model feature extraction technology for the realization of studies, research and innovation main points are as follows:
语法：状语，动词，句式。

The thesis studies the technologies of 3-D model shapes and extraction of features on the basis of conducting fully reading of related documents. The major work and new ideas are as follows:
实现了三维模型的表示和规范化预处理过程，开发了进行检索实验的可视化特征提取实验平台。

Realized that the three-dimensional model and standardized pretreatment process, and on this basis has been developed for the visualization of experimental search feature extraction experiment platform.
语法：并列成分，动词
1. Implementing（The thesis implements 或者使用被动语态）the representation of 3-D models and normalization preprocessing, and developing the visualized experiment platform which can be used in the retrievals of 3-D models.
摘要翻译练习（1）
互联网可扩展路由
全球路由表的高速膨胀,使互联网路由系统的可扩展性面临着严峻的挑战.为了缩减路由表,很多研究提出了新的路由解决方案.在介绍了互联网路由系统现状之后,从较高层次上将存在的解决方案分为短期方案、路由架构和可扩展路由算法3部分.着重介绍了路由算法和路由架构这两类工作,对经典的可扩展路由算法和路由架构进行了深入的分析和比较.最后讨论了有待解决的关键问题和未来的研究方向.
The Internet routing system is facing a serious scaling challenge due to the rapid growth of the global routing table. For the purpose of reducing routing table size, many studies have developed a lot of new routing solutions. After the paper introduces the background of the Internet routing system, a classification of new routing solutions is presented. Then, a typical scalable routing algorithms and architectures become the focus, and their basic ideas and characteristics are deeply analyzed and compared. Finally, some key issues and ideas for future research are discussed.
摘要翻译练习（2）
基于社会网络特征的P2P内容定位策略
提高文件的查找定位效率是无结构的P2P网络一个重要的研究内容.泛洪法和随机查找法虽然简单和易于实现,但是前者会较大地增加网络负载,而且搜索的深度不能太大;后者虽然可以降低网络负载和适当增加搜索深度,但却以牺牲搜索的广度和增加响应时间为代价.提出一个无结构
P2P内容分发网络的内容定位和查找请求路由方案.它利用社会网络的基本原理,通过模拟社会网络的特征,发挥节点的能动性,可以在有限的搜索深度和广度内快速查找定位文件.模拟实验结果表明,在相同的硬件环境支持下,P2P网络文件平均定位时间可以缩短50%以上.
Strategy of Content Location of P2P Based on the Social Network
Enhancing the efficiency of the file location is important in the study of unstructured P2P network. Flooding and random walks are simple and easily implemented. However, the former will increase the load of P2P network too much and put bounds to the search depth, and the latter’s lower network load and deeper search comes at the cost of lower search breadth and more response time. This paper puts forward a strategy of content location and routing of a search request in an unstructured P2P network. By applying the rationale of social network and simulating the ability of the peers of social network, the strategy proposed in this paper, can make better use of the ability of the peers and locate files faster with lower search depth and breadth. Supported by the equivalent hardware environment, the experimental results demonstrate that the time spent on content location can be reduced by more than 50%.。