| ²é¿´: 1513 | »Ø¸´: 5 | |||
| ±¾Ìû²úÉú 1 ¸ö ·ÒëEPI £¬µã»÷ÕâÀï½øÐв鿴 | |||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | |||
ghost_gameÒø³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
°ïæ·ÒëÕªÒªÖеÄ2¾ä»°~~~~
|
||
|
ÔÎÄ£º Ìá³öÒ»ÖÖ½«ÐÅÈζÈÓë²ÎÊý»¯Ô¼ÊøÏà½áºÏµÄƾ֤Á´·¢ÏÖËã·¨£¬Ä£ÄâʵÑé±íÃ÷£¬¸Ä½øºóµÄËã·¨¿ÉÒÔÓÐЧµØ¶Ô²»Á¼ÊµÌåµÄÇëÇó½øÐÐÆÁ±Î£¬ÊµÏÖÁ˽ÏÁé»îµÄϸÁ£¶ÈÊÚȨ£¬Í¬Ê±¸ÃËã·¨Ìá¸ßÁ˼ÆËãЧÂÊ£¬¼õÉÙÁ˽¨Á¢Æ¾Ö¤Á´ËùºÄ·ÑµÄ¿Õ¼ä¡£ |
» ²ÂÄãϲ»¶
ʱ¼ä´Á±äÁË£¬ÄÜ¿´³öʲôÎÊÌ⣿
ÒѾÓÐ11È˻ظ´
»¶Ó·¢À´filecodeµÄMz6ºóµÄ´úÂëÑéÖ¤Æä¹æÂÉ
ÒѾÓÐ109È˻ظ´
ÖØÒªÏûÏ¢£¬ÖÐÎçϵͳÔÚά»¤
ÒѾÓÐ10È˻ظ´
Á½½ãÃã¬Ò»¸öÐÁÐÁ¿à¿à30Ë깤×÷µ±´óѧ½Ìʦ£¬ÁíÒ»¸ö23Ëê¾Í¹¤×÷µ±¿ª³µ½ÌÁ·
ÒѾÓÐ7È˻ظ´
Ã÷Ìì·Å°ñ£¿
ÒѾÓÐ4È˻ظ´
Ͷ¸å×Éѯ
ÒѾÓÐ6È˻ظ´
ʱ¼ä´ÁÓÖ±äÁË8-15
ÒѾÓÐ26È˻ظ´
½ñÌìά»¤ÏµÍ³Î¬»¤ ×£ËùÓÐÈË ¸ßÖÐ
ÒѾÓÐ9È˻ظ´
ÄÄλÀϸçÖªµÀ½ñÄêµÄ¹ú×ÔÈ»¾ßÌåÄÄÒ»Ìì·Å°ñ£¿
ÒѾÓÐ16È˻ظ´
2027¹ã¶«Ê¡½ÜÇà
ÒѾÓÐ8È˻ظ´

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
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
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










»Ø¸´´ËÂ¥