| 查看: 1509 | 回复: 5 | |||
| 本帖产生 1 个 翻译EPI ，点击这里进行查看 | |||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | |||
ghost_game银虫 (正式写手)
|
[求助]
帮忙翻译摘要中的2句话~~~~
|
||
|
原文： 提出一种将信任度与参数化约束相结合的凭证链发现算法，模拟实验表明，改进后的算法可以有效地对不良实体的请求进行屏蔽，实现了较灵活的细粒度授权，同时该算法提高了计算效率，减少了建立凭证链所耗费的空间。 |
回复此楼» 猜你喜欢
今天维护系统维护 祝所有人 高中
已经有7人回复
-
读博的好处
已经有5人回复
-
哪位老哥知道今年的国自然具体哪一天放榜？
已经有16人回复
-
欢迎发来filecode的Mz6后的代码验证其规律
已经有98人回复
-
2027广东省杰青
已经有8人回复
-
快农历七夕节了，轻松一下，男人悄悄话，女施主请不要进来。
已经有5人回复
-
投稿咨询
已经有5人回复
-
时间戳变了，能看出什么问题？
已经有6人回复
-
93BebMhtakh前后11位开头都是大写
已经有5人回复
-
感觉是下周放榜了
已经有11人回复
wgz0625
木虫 (小有名气)
- 应助: 0 (幼儿园)
- 金币: 2651.3
- 红花: 3
- 帖子: 229
- 在线: 48小时
- 虫号: 1160787
- 注册: 2010-12-02
- 性别: GG
- 专业: 药物化学
【答案】应助回帖
★ ★ ★ ★ ★
爱与雨下(金币+1): 2011-11-18 13:33:21
sltmac(金币-6): 抄袭 2011-11-20 11:23:52
爱与雨下(金币+1): 2011-11-18 13:33:21
sltmac(金币-6): 抄袭 2011-11-20 11:23:52
| Propose a discovery algorithm of credential chain to combine trust rank with parameterization constraints. Model exam showed that improved algorithm can shield efficiently to requests from adverse entity and realized acuter fine grain authorization.And simultaneously, this algorithm enhanced the computing efficiency and reduced the space to build the credential chains. |
5楼2011-11-18 12:37:58
fjtony163
版主 (文坛精英)
米米
- 翻译EPI: 386
- 应助: 361 (硕士)
- 贵宾: 6.876
- 金币: 70612.6
- 散金: 36050
- 红花: 222
- 沙发: 616
- 帖子: 21912
- 在线: 3793.8小时
- 虫号: 1397876
- 注册: 2011-09-11
- 专业: 遗传学研究新技术与方法
- 管辖: 论文翻译
【答案】应助回帖
★ ★ ★ ★ ★ ★
爱与雨下(金币+1): 2011-11-13 19:34:57
sltmac(金币+5): 2011-11-22 10:09:34
sltmac(翻译EPI+1): 2011-11-22 10:09:38
爱与雨下(金币+1): 2011-11-13 19:34:57
sltmac(金币+5): 2011-11-22 10:09:34
sltmac(翻译EPI+1): 2011-11-22 10:09:38
| Propose a discovery algorithm of credential chain to combine trust rank with parameterization constraints. Model exam showed that improved algorithm can shield efficiently to requests from adverse entity and realized acuter fine grain authorization. It also increased calculation efficiency and reduced used space for constructing credential chain. |
2楼2011-11-13 18:58:51
alvarohao
铁杆木虫 (著名写手)
- 翻译EPI: 85
- 应助: 0 (幼儿园)
- 贵宾: 0.005
- 金币: 13664.2
- 红花: 3
- 沙发: 5
- 帖子: 2355
- 在线: 261.5小时
- 虫号: 1402388
- 注册: 2011-09-15
- 性别: MM
- 专业: 机械结构强度学
【答案】应助回帖
★ ★ ★ ★ ★ ★
爱与雨下(金币+1): 2011-11-13 19:35:04
sltmac(金币+5): 2011-11-22 10:09:42
爱与雨下(金币+1): 2011-11-13 19:35:04
sltmac(金币+5): 2011-11-22 10:09:42
| A credential chain discovery algorithm based on the combination of the trust rank and the parameterized constraints was proposed. The simulation showed that the modified algorithm can effectively shield the requests from the undesirable entities, achieving the fine grit authorization in a rather flexible way. And simultaneously, this algorithm enhanced the computing efficiency and reduced the space to build the credential chains. |
3楼2011-11-13 19:04:47
xiulongfei
木虫 (职业作家)
- 翻译EPI: 4
- 应助: 16 (小学生)
- 金币: 4665.7
- 散金: 54
- 红花: 3
- 沙发: 3
- 帖子: 3108
- 在线: 126小时
- 虫号: 1489719
- 注册: 2011-11-13
- 性别: GG
- 专业: 食品科学
【答案】应助回帖
★ ★ ★ ★ ★ ★
爱与雨下(金币+1): 2011-11-17 10:04:32
sltmac(金币+5): 2011-11-22 10:09:49
爱与雨下(金币+1): 2011-11-17 10:04:32
sltmac(金币+5): 2011-11-22 10:09:49
| An algorithm to discover credential chains ,combining trust level with parametric constraints, was brought forward.The simulation experiment shows that the improved algorithm can effectively shield requests of bad entities to realize the flexible fine grit available, meanwhile it increased computing efficiency and reduced the spaces of setting up credential chains. |
4楼2011-11-17 09:52:18
