找回密码
 注册
查看: 440|回复: 0

R语言 VGAM包 wffc.points()函数中文帮助文档(中英文对照)

[复制链接]
发表于 2012-10-1 15:58:34 | 显示全部楼层 |阅读模式
wffc.points(VGAM)
wffc.points()所属R语言包:VGAM

                                         Point System for the 2008 World Fly Fishing Championships
                                         2008年世界飞钓锦标赛点系统

                                         译者:生物统计家园网 机器人LoveR

描述----------Description----------

Point system for the 2008 World Fly Fishing Championships: current and some proposals.
2008年世界飞钓锦标赛点系统:当前的一些建议。


用法----------Usage----------


wffc.P1(length, c1 = 100, min.eligible = 0.18, ppm = 2000)
wffc.P2(length, c1 = 100, min.eligible = 0.18, ppm = 2000)
wffc.P3(length, c1 = 100, min.eligible = 0.18, ppm = 2000)
wffc.P1star(length, c1 = 100, min.eligible = 0.18, ppm = 2000)
wffc.P2star(length, c1 = 100, min.eligible = 0.18, ppm = 2000)
wffc.P3star(length, c1 = 100, min.eligible = 0.18, ppm = 2000)



参数----------Arguments----------

参数:length
Length of the fish, in meters. Numeric vector.  
鱼的长度,以米为单位。数字矢量。


参数:c1
Points added to each eligible fish.  
点添加到每个符合条件的鱼。


参数:min.eligible
The 2008 WFFC regulations stipulated that the smallest eligible fish was 0.180 m, which is 180 mm.  
2008年WFFC规定,最小的合资格的鱼0.180米,为180毫米。


参数:ppm
Points per meter of length of the fish.  
每米的鱼的长度的问题。


Details

详细信息----------Details----------

The official website contains a document with the official rules and regulations of the competition. The function wffc.P1() implements the current WFFC point system, and is "discrete" in that fish lengths are rounded up to the nearest centimeter (provided it is greater or equal to min.eligible m). wffc.P1star() is a "continuous" version of it.
的官方网站上有一个文件与正式比赛的规则及规例。的功能wffc.P1()的的电流WFFC点系统实现,是“离散”中,鱼的长度向上舍入到最接近的厘米(它大于或等于min.eligibleM)。 wffc.P1star()的版本,它是一个“连续”。

The function wffc.P2() is a new proposal which rewards catching bigger fish. It is based on a quadratic polynomial. wffc.P2star() is a "continuous" version of it.
函数wffc.P2()是一个新的建议,奖励捕获更大的鱼。它是基于一个二次多项式。 wffc.P2star()的版本,它是一个“连续”。

The function wffc.P3() is another new proposal which rewards catching bigger fish. Named a cumulative linear proposal, it adds ppm to each multiple of min.eligible of length. One adds one lot of c1 to each eligible fish. wffc.P3star() is a "continuous" version of wffc.P3().
函数wffc.P3()是另一个新的建议,奖励捕获更大的鱼。命名的累计线性的建议,增加了ppm每个多的min.eligible的长度。加上很多c1每名合资格的鱼。 wffc.P3star()是一个“连续”版本的wffc.P3()。


值----------Value----------

A vector with the number of points.
的点的数量的向量。


注意----------Note----------

wffc.P2 and wffc.P2star may change in the future, as well as possibly wffc.P3 and wffc.P3star.
wffc.P2和wffc.P2star可能在未来改变,以及可能wffc.P3和wffc.P3star。


(作者)----------Author(s)----------


T. W. Yee.



参考文献----------References----------

On strategies and issues raised by an analysis of the 2008 World Fly Fishing Championships data. In preparation.

参见----------See Also----------

wffc.
wffc。


实例----------Examples----------


## Not run:  fishlength = seq(0.0, 0.72, by = 0.001)[#不运行:fishlength = SEQ(0.0,0.72,= 0.001)]
plot(fishlength, wffc.P2star(fishlength), type = "l", col = "blue",
     las = 1, lty = "dashed", lwd = 2, las = 1, cex.main = 0.8,
     xlab = "Fish length (m)", ylab = "Competition points",
     main = "Current (red) and proposed (blue and green) WFFC point system")
lines(fishlength, wffc.P1star(fishlength), type = "l", col = "red", lwd = 2)
lines(fishlength, wffc.P3star(fishlength), type = "l", col = "darkgreen",
      lwd = 2, lty = "dashed")
abline(v = (1:4) * 0.18, lty = "dotted")
abline(h = (1:9) * wffc.P1star(0.18), lty = "dotted")
## End(Not run)[#(不执行)]

# Successive slopes:[连续的斜坡:]
(wffc.P1star((2:8)*0.18) - wffc.P1star((1:7)*0.18)) / (0.18 * 2000)
(wffc.P3star((2:8)*0.18) - wffc.P3star((1:7)*0.18)) / (0.18 * 2000)

转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。


注:
注1:为了方便大家学习,本文档为生物统计家园网机器人LoveR翻译而成,仅供个人R语言学习参考使用,生物统计家园保留版权。
注2:由于是机器人自动翻译,难免有不准确之处,使用时仔细对照中、英文内容进行反复理解,可以帮助R语言的学习。
注3:如遇到不准确之处,请在本贴的后面进行回帖,我们会逐渐进行修订。
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册

本版积分规则

手机版|小黑屋|生物统计家园 网站价格

GMT+8, 2024-11-26 12:44 , Processed in 0.023228 second(s), 15 queries .

Powered by Discuz! X3.5

© 2001-2024 Discuz! Team.

快速回复 返回顶部 返回列表