|
|
本帖最后由 xuyongchen 于 2012-1-18 16:47 编辑
五项挑战赛小项目选择中有NFS@Home这一个，去equn的项目介绍中查看介绍时发现项目介绍没有被翻译，然后找了一下发现还有好些项目没有翻译介绍。翻译一下，讨论讨论
1.NFS@Home
原文：NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers. As a young school student, you gained your first experience at breaking an integer into prime factors, such as 15 = 3 * 5 or 35 = 5 * 7. NFS@Home is a continuation of that experience, only with integers that are hundreds of digits long. Most recent large factorizations have been done primarily by large clusters at universities. With NFS@Home you can participate in state-of-the-art factorizations simply by downloading and running a free program on your computer.
Integer factorization is interesting from both mathematical and practical perspectives. Mathematically, for instance, the calculation of multiplicative functions in number theory for a particular number require the factors of the number. Likewise, the integer factorization of particular numbers can aid in the proof that an associated number is prime. Practically, many public key algorithms, including the RSA algorithm, rely on the fact that the publicly available modulus cannot be factored. If it is factored, the private key can be easily calculated. Until quite recently, RSA-512, which uses a 512-bit modulus (155 digits), was commonly used but can now be easily broken.
The numbers what we are factoring are chosen from the Cunningham project. Started in 1925, it is one of the oldest continuously ongoing projects in computational number theory. The third edition of the book, published by the American Mathematical Society in 2002, is available as a free download. All results obtained since, including those of NFS@Home, are available on the Cunningham project website.
NFS@Home is hosted at California State University Fullerton.
翻译：NFS@Home是一个运用网络连接计算机来进行大型整数数域筛选分解格筛步骤的一个研究项目。当你还是一个年轻的学生时，你就有了分解质因数的经历，比如15=3*5或者35=5*7。NFS@Home是这一经历的延续，（不过）仅仅分解有数百位数字长的整数。大多数最新分解的大型整数主要都是由大学里的计算机集群完成的。在NFS@Home的帮助下，你可以参与到国家最先进的因数分解（项目中），（而这一切）只需要在电脑里下载并且运行一个免费的程序。
整数的因子分解在数学和实际（运用）角度上都很有趣。数学上，例如，在数论中某些特定的数字的乘法计算就需要用到这些数字的因子。同样的，特定整数的因数分解有助于证明一个相关联的数字是质数。实际生活中，很懂公共密钥算法，包括RSA算法，都是基于公开模是不能被分解这一事实。如果它是能够分解的，私人密码将被轻易的计算出来。直到最近，曾经广泛使用的RSA-512，使用512bit模（155数位），已经被轻易的破解了。
我们正在分解的数字是从坎宁安项目中选出来的。该项目开始于1925年，是最老的仍在进行的计算数论项目之一。由美国数学协会2002年出版的第三版的书现在可以在网上免费下载。所有获得的结果，包括NFS@Home所获得的，都可以在坎宁安项目网站上获得。
NFS@Home由加州州立大学富勒顿分校主持。
2.WEP-M+2（equn的项目介绍中有两个同样的WEP-M+2项目，可以删除一个）
原文：WEP-M+2 (wanless2) is a research project that uses Internet-connected computers to do research in number theory. You can participate by downloading and running a free program on your computer. WEP-M+2 is based at London, UK, and is currently investigating factorization of Mersenneplustwo numbers.
翻译：WEP-M+2(wanless2）是一个使用网络连接计算机进行数论研究的项目。你可以通过在电脑上下载并运行一个免费的程序来参与该项目。WEP-M+2项目设在英国伦敦。目前项目正在收集Mersenneplustwo数字。（梅森素数是2^P-1，P也为素数，Mersenneplustwo数字是梅森素数+2即为2^P+1）
3.TANPAKU
原文：TANPAKU is the project that is aiming at attacking "protein structure prediction" problem by using "distributed computing" method. This project is developed in collaboration with Yamato lab.(in the Department of Biological Science and Technology) and Takeda lab.(in the Department of Information Sciences) groups at Tokyo University of Science. Now, the project finished a preliminary test within our university and it is open for public volunteers.
翻译：TANPAKU是一项通过分布式计算方法致力于解决蛋白质结构预测问题的项目。该项目由东京理科大学大和实验室（属于生物科学技术系）以及武田实验室（属于信息科学系）共同开发。目前，项目和我们大学一起完成了初步的测试并向公众志愿者开放。
4.Rsa Lattice Siever
原文：Rsa Lattice Siever is a research project that uses Internet-connected computers to help others factoring project such as mersenneforum or XYYXf achieve their academic goals. You can participate by downloading and running a free program on your computer.
翻译：Rsa Lattice Siever是一个利用网络连接计算机帮助例如mersenneforum或者XYYXf等其他因数分解项目取得成果的研究项目。通过在电脑上下载并运行一个免费的程序，你可以参与到该项目中。
5.Magnetism@home
原文：Magnetism@home is a research project that uses Internet-connected computers to explore the equlibrium, metastable and transient magnetization patterns (first and foremost in nano-scale magnetic elements and their arrays, but later other systems may be considered). You can participate by downloading and running a free program on your computer.
The project is based at Donetsk Institute for Physics and Technology.
翻译：Magnetism@home是一个利用网络连接计算机来探索平衡点，亚稳态和瞬态磁化模式（最初并最主要是研究纳米尺度下的磁性元件以及它们的排列，不过之后其他的系统可能也会被考虑）的研究项目。你可以通过电脑下载并运行一个免费程序加入到该项目中。
项目设在顿涅茨克物理科学与技术研究所
6.Biochemical Library
原文：BCL is a research project that uses Internet-connected computers to do research in BCL. You can participate by downloading and running a free program on your computer.
BCL is based at Vanderbilt University and hosted by Information Technology Services.
The Biochemical Library is developed by the MeilerLab.
翻译：BCL是一个利用网络连接计算机在BCL上进行研究的研究项目。你可以通过在电脑上下载并运行一个免费的软件参与到该项目中。
BCL项目设在范德堡大学并由资讯科技服务主持。
Biochemistry Library由梅勒实验室开发
7.Ramsey@Home（打红字的your似乎应该换成you are）
原文：Ramsey@Home is a distributed computing project designed to find new lower bounds for various Ramsey Numbers using a host of different techniques. It was inspired by the research of Dr. David Furcy, Dr. Thomas Naps, Dr. Linda Eroh, and Nick Peterson during the 2008 spring and summer semester at the University of Wisconsin-Oshkosh.
Ramsey@Home is currently under development, with a projected start date sometime in late August 2008.
If your interested in the mathematics this project deals with, you can read about Ramsey Numbers here. Also, the proposal for our research can be viewed here. Ramsey numbers describe the least number of nodes needed to insure that certain types of patterns exist in graphs made up of nodes and colored edges. Ramsey@Home hopes to raise the lower bounds of R(3,3,3,3,3) or R(4,4,4,4,4). More information about Ramsey Numbers can be found at wikipedia:Ramsey's theorem
翻译：Ramsey@Home是一个设计目标为通过使用各种不同的技术为拉姆塞数寻找新下界的分布式计算项目。项目灵感来自于大卫 福希博士（Dr.David Furcy），汤姆斯 奈普博士（Dr Thomas Naps）琳达 伊偌博士（Dr Linda Eroh）以及尼克 皮特森（Nick Peterson）在威斯康星大学奥什科什分校2008年春季和夏季学期的研究。
Ramsey@Home现在正在开发，预计开始时间是2008年8月末的某个时间。
如果你对这个项目所涉及的数学感兴趣，你可以通过这里阅读关于拉姆塞数（的信息）。同样的，对我们的研究的建议可以在这里浏览。拉姆塞数描述了确保某种特定类型的由节点和彩色边缘构成的在图形中存在的模型最少需要多少节点。Ramsey@Home希望能够提升R(3,3,3,3,3)或者R（4,4,4,4,4）的下界。更多关于拉姆塞数的信息可以参考维基百科：拉姆塞定理
8.EDGeS@Home
原文：The aim of the EDGeS@Home project is to create a connection between volunteer computing and service grids, by allowing service grid jobs to be processed by volunteers, thus integrating volunteers into the wast scientific researches that have so far been researched with service grids.
The project currently hosts the ISDEP - Integrator of Stochastic Differential Equations in Plasmas - application.
EDGeS is a European project with the aim of creating an integrated Grid infrastructure that seamlessly integrates a variety of Desktop Grids with EGEE type of service Grids.
翻译：EDGeS@Home项目的目标是创建志愿计算和服务网格之间的联系，通过允许服务网格的任务被志愿者们运行，从而将志愿者并入那些已经被服务网格研究过的科学的研究中。
项目目前运行ISDEP-等离子体中的随机微分方程集成-主机应用程序。
EDGeS是一个欧洲项目，致力于创建一个无缝整合大量EGEE结构服务网格的台式机网格的完整的网格结构。
9.Renderfarm.fi
原文：Renderfarm.fi is a platform for doing distributed rendering over the Internet. It is a completely free service that enables its users to render their animations or stills by using the computing power of volunteers from around the world. By doing so, graphic artists and animators benefit from being able to use higher image quality and higher resolutions when rendering. Equally importantly, it enables its users to participate in the rendering of stills and animations, regardless of whether or not they themselves are able to or even interested in learning about 3D modeling and animation. Our aim is to make Renderfarm.fi as accessible as possible, enabling as many people as possible to both take part in and take use of the technologies behind the service. The Renderfarm.fi crew encourages you to take part in both the online community and the collaborative rendering.
翻译：Renderfarm.fi是一个基于网络平台的分布式渲染平台。这是一个完全免费的服务，使得用户可以通过来自全世界的志愿计算力量渲染他们自己的动画或静态（画稿）。这样做，可以使图形艺术家和动画制作者使用更好的画质和更好的渲染解决方案而受益。同样重要的是，它使得用户可以参与到静态（画稿）和动画的渲染中而不管他们是否有没有兴趣学习3D建模和动画。我们的目标就是让Renderfarm.fi尽可能的平易近人，让尽可能多的人可以既参与又受益于该服务背后的技术。Renderfarm.fi全体人员鼓励你参与在线社区以及相关渲染（服务）。
10.Proteins@home
原文：Proteins@home is a large-scale non-profit protein structure prediction project utilizing distributed computing to perform a lot of computations in a small amount of time. From their website:
The amino acid sequence of a protein determines its three-dimensional structure, or 'fold'. Conversely, the three-dimensional structure is compatible with a large, but limited set of amino acid sequences. Enumerating the allowed sequences for a given fold is known as the 'inverse protein folding problem'. We are working to solve this problem for a large number of known protein folds (a representative subset: about 1500 folds). The most expensive step is to build a database of energy functions that describe all these structures. For each structure, we consider all possible sequences of amino acids. Surprisingly, this is computationally tractable, because our energy functions are sums over pairs of interactions. Once this is done, we can explore the space of amino acid sequences in a fast and efficient way, and retain the most favorable sequences. This large-scale mapping of protein sequence space will have applications for predicting protein structure and function, for understanding protein evolution, and for designing new proteins. By joining the project, you will help to build the database of energy functions and advance an important area of science with potential biomedical applications.
For more information, goto this link: Project Overview
翻译Proteins@home是一个利用分布式计算在短时间内完成大量计算的大规模非盈利蛋白质结构预测项目。通过他们的网站可以了解：
蛋白质的氨基酸序列决定了它的三维结构，或者折叠。相反的，三维结构可以兼容一个（相对）较大但是有限制的氨基酸序列集合。为一个给定的折叠列举允许的序列被称为逆蛋白质折叠问题。我们力图为大量已知蛋白质折叠解决这个问题（一个有代表性的子集：大约1500个折叠）。最昂贵的部分是为能够描述所有这些结构的能量函数建立数据库。对于每一个结构，我们考虑所有可能的氨基酸序列。令人惊奇的是，这在计算上是易进行的，因为我们的能量函数是很多对相互作用的总和。一旦这一步被完成，我们可以以一种更快更有效率的方式探索氨基酸序列空间。这一大规模绘制蛋白质序列空间将在预测蛋白质结构和功能，理解蛋白质演化以及设计新的蛋白质方面有所应用。通过加入这一项目，你可以帮忙建立能量函数的数据库并且通过潜在生物医药应用（帮助）发展科学的一个重要领域。
更多的信息，请点击链接：项目总览
11.Virus Respiratorio Sincitial
原文：Virus Respiratorio Sincitial (VRS) (from the Spanish Virus Respiratorio Sincitial) is a BOINC-based project which main aim is to simulate the behaviour of the human Respiratory Syncytial Virus (RSV). Main facts:
It is the major cause of lower respiratory tract infection and hospital visits during infancy and childhood.
In Spain, it causes more than 15.000 padiatrician visits per year.
It is responsible for more than 18% of the pneumonia elderly hospitalizations.
In the United States, 60% of infants are infected during their first RSV season. Nearly all children will have been infected with the virus by 2-3 years of age. Of those infected with RSV, 23% will develop bronchiolitis necessitating hospitalization.
Our project simulations of the RSV contagion mechanisms will allow:。
Better understanding of the contagion evolution and its relevant parameters.
Faster predictions of the virus population evolution.
Designing more accurate vaccination campaigns.
You can contact the researcher on charge for additional information: Doctor Javier Villanueva Email jvillanueva AT cesfelipesegundo.com Phone number +34 91 809 92 00 extension 210 Universidad Complutense de Madrid - CES Felipe II Aranjuez - Madrid - Spain Project Web Page HERE. Project Status Page http://falua.cesfelipesegundo.com/VRS/server_status.php
翻译：Virus Respiratorio Sincitial（VRS）（来自西班牙语Virus Respiratorio Sincitial）是一个基于BOINC平台的项目。它的主要目的是模拟人类呼吸道合胞病毒的行为。主要的事实：
这是幼年时下呼吸道感染以及就诊的主要原因。
在西班牙，它是每年超过15.000次儿科就诊的原因。
超过18%的老年人肺炎住院与之有关。
在美国，60%的婴儿在他（她）们的第一个RSV季节被感染。在2-3岁以前，几乎所有的儿童都曾经被感染过病毒。在那些感染过RSV的儿童当中，23%的将因为发展成为支气管炎而住院治疗。
我们的项目模拟RSV的传染机制将得到：
更好的关于传染途径和相关参数的理解
更快的预测病毒种群演化
设计更准确的疫苗
你可以联系研究人员获取进一步的信息：Javier Villanueva博士 e-mail：jvillanueva@cesfelipesegundo.com 电话：+34 91 809 92 00转210 马德里康普斯顿大学 CES Felipe II Aranjuez -Madrid- 西班牙项目网页：点击这里 项目状态页：http://falua.cesfelipesegundo.com/VRS/server_status.php
12.Anansi（我这个条目有些内容不能理解，翻译不能。。哪位接个手？）
原文：Anansi is a research project that uses Internet-connected computers to explore web resources around the world. Basically we want to do an evaluation regarding accuracy and performance on a distributed web crawler, and BOINC is our final choice after consideration. Measurements in such a system including accuracy, robustness, flexibility and performance will be evaluated.
In Anansi, clients returned only URIs been crawled associate with URI's http status code that indcating availability of it. Only URIs with scheme http itself that can be reached by the public will be crawled. No E-mail address, words content or user, password will be collected. It is an non-cpu-intensive project, which is trying to reduce CPU loads on the client. Associative information such as robots exclusion and some page contents are being collected and used by BOINC Volunteers during crawling, but none of them will be returned to Anansi server.
The data(URIs) collected by Anansi will be used by a Map-reduce engine that calculates priorities for each URI. The priority is established upon In-degree, out-degree and timestamp created by Anansi Server. Anansi server take it into consideration for revisit plans, which maintains a continuely working system.
Anansi is currently maintained by Operating Systems Research (OSR) Lab @ North Carolina State University
More on Active Projects in OSR
The project is currently maintained by Kunsheng Chen@LinkedIn
Contact us through kchen3 AT ncsu.edu
翻译：Anansi是一个利用网络连接计算机来探索世界网络资源的研究项目。原则上我们希望基于准确性和性能在分布式网络爬虫上做一个评估，经过考虑，BOINC是我们最终的选择。在这样的一个系统中包括准确性，稳定性，适应性和性能等将被测量。 |
评分
-
查看全部评分
|
发表于 2011-4-19 12:53:49
发表于 2011-4-19 17:06:59
发表于 2011-8-12 23:02:31
发表于 2012-1-18 11:19:43
