| ²é¿´: 3862 | »Ø¸´: 4 | |||
xzllxlsľ³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
ÓÐûÓÐÈËÖªµÀPath Ranking Algorithm£¿ ÒÑÓÐ1È˲ÎÓë
|
|
ÎÒµ¼Ê¦¸øÁËÎÒÒ»¸öÖ÷ÌâPath Ranking Algorithm£¬ÈÃÎÒ×Ô¼º²éÔÄÏà¹Ø×ÊÁÏ£¬È»ºóдһ·Ý±¨¸æ·¢¸øËû¡£ ÎÒÏëÇë½Ì¸÷λ³æÓÑ£¬ÓÐûÓÐÈËÖªµÀ¸ÃËã·¨£¿ »òÕßÄÜ·ñ°ïÃ¦ÍÆ¼öһЩ¹ØÓÚ¸ÃËã·¨µÄÎÄÏ×£¿ »¹ÓУ¬ÏñÕâÑù¸ö±¨¸æÓ¦¸ÃÔõÃ´Ð´ÄØ£¿ лл£¡ |
» ÊÕ¼±¾ÌûµÄÌÔÌûר¼ÍƼö
³ÌÐò |
» ²ÂÄãϲ»¶
0856²ÄÁÏר˶353Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
ɽ¶«Ê¡ÃæÉÏÏîÄ¿ÏÞ¶îÆÀÉó
ÒѾÓÐ4È˻ظ´
Ò»Ö¾Ô¸±±¾©»¯¹¤´óѧ070300 ѧ˶336Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
ÉúÎïѧ071000 329·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
Ò»Ö¾Ô¸»ªÖпƼ¼´óѧ071000£¬Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
ÉúÎïѧһ־Ը985£¬·ÖÊý349Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
ÉúÎïѧµ÷¼Á
ÒѾÓÐ4È˻ظ´
Çóµ÷¼ÁԺУÐÅÏ¢
ÒѾÓÐ4È˻ظ´
085600²ÄÁÏÓ뻯¹¤306
ÒѾÓÐ4È˻ظ´
286Çóµ÷¼Á
ÒѾÓÐ10È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
VariflexÔÚlinuxϵݲװ
ÒѾÓÐ3È˻ظ´
ANSYS FLUENT 12.1.2 ×°ÍêÔËÐÐFLUENT³ö´í
ÒѾÓÐ12È˻ظ´
Abaqus6.10_°²×°¼°ºº»¯ËµÃ÷
ÒѾÓÐ23È˻ظ´
11¾ä°²Î¿ÉËÐÄÈ˵ÄÓ¢Óï
ÒѾÓÐ8È˻ظ´
ANSYSÖÐÓ¦Á¦Ç¿¶ÈÒò×ÓÓëJ»ý·ÖµÄ¼ÆËã[×ªÔØ]
ÒѾÓÐ5È˻ظ´
Dalton2011²¢ÐбàÒëÏê¼Ç
ÒѾÓÐ33È˻ظ´
ËãDOSʱ³ö´í
ÒѾÓÐ15È˻ظ´
ÇëÎÊÒ»¸öIRCÄÜÁ¿µÄÌáÈ¡ÎÊÌ⣬лл¸÷λ
ÒѾÓÐ2È˻ظ´
»®´¬²»Óý¬
ľ³æ (ÕýʽдÊÖ)
- Ó¦Öú: 1 (Ó×¶ùÔ°)
- ½ð±Ò: 2521.2
- É¢½ð: 21
- ºì»¨: 7
- Ìû×Ó: 328
- ÔÚÏß: 177.2Сʱ
- ³æºÅ: 4013086
- ×¢²á: 2015-08-09
- ÐÔ±ð: GG
- רҵ: ģʽʶ±ð
2Â¥2016-07-30 23:39:23
xzllxls
ľ³æ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 4814.3
- É¢½ð: 242
- Ìû×Ó: 725
- ÔÚÏß: 290.5Сʱ
- ³æºÅ: 1969529
- ×¢²á: 2012-09-02
- רҵ: ¼ÆËã»úÓ¦Óü¼Êõ
3Â¥2016-07-31 09:24:28
FMStation
ÖÁ×ðľ³æ (ÖªÃû×÷¼Ò)
- ÐÅÏ¢EPI: 1
- Ó¦Öú: 591 (²©Ê¿)
- ¹ó±ö: 0.03
- ½ð±Ò: 18348.2
- ºì»¨: 97
- Ìû×Ó: 8891
- ÔÚÏß: 1489.9Сʱ
- ³æºÅ: 2400059
- ×¢²á: 2013-04-04
- רҵ: ¼ÆËã»úÓ¦Óü¼Êõ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï
xzllxls: ½ð±Ò+5, ¡ï¡ï¡ïºÜÓаïÖú, ·Ç³£Ïêϸ£¬ºÜ¸Ðл£¡ 2016-08-02 23:56:05
xzllxls: ½ð±Ò+5, ¡ï¡ï¡ïºÜÓаïÖú, ·Ç³£Ïêϸ£¬ºÜ¸Ðл£¡ 2016-08-02 23:56:05
|
The repository of PRA (Path Ranking Algorithm) and SFE (Subgraph Feature Extraction) https://github.com/matt-gardner/pra Efficient and Expressive Knowledge Base Completion Using Subgraph Feature Extraction. Matt Gardner and Tom Mitchell. EMNLP 2015. http://rtw.ml.cmu.edu/emnlp2015_sfe Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases. Matt Gardner, Partha Talukdar, Jayant Krishnamurthy, and Tom Mitchell. EMNLP 2014. http://rtw.ml.cmu.edu/emnlp2014_vector_space_pra Improving Learning and Inference in a Large Knowledge-base using Latent Syntactic Cues. Matt Gardner, Partha Talukdar, Bryan Kisiel, and Tom Mitchell. EMNLP 2013. http://rtw.ml.cmu.edu/emnlp2013_pra Slides: http://brenocon.com/NiLao_2011.lecture.SPLODD.pdf The original paper is Relational Retrieval using a combination of path-constrained random walks. https://www.cs.cmu.edu/~nlao/publication/2010/2010.ML.PRA.pdf Ni Lao, Tom Mitchell and William Cohen. Random Walk Inference and Learning in A Large Scale Knowledge Base https://www.cs.cmu.edu/~nlao/pub ... 011.emnlp.paper.pdf Ni Lao, Amarnag Subramanya, Fernando Pereira, and William Cohen. Reading The Web with Learned Syntactic-Semantic Inference Rules https://www.cs.cmu.edu/~nlao/pub ... 012.emnlp.paper.pdf |
4Â¥2016-08-02 18:31:16
FMStation
ÖÁ×ðľ³æ (ÖªÃû×÷¼Ò)
- ÐÅÏ¢EPI: 1
- Ó¦Öú: 591 (²©Ê¿)
- ¹ó±ö: 0.03
- ½ð±Ò: 18348.2
- ºì»¨: 97
- Ìû×Ó: 8891
- ÔÚÏß: 1489.9Сʱ
- ³æºÅ: 2400059
- ×¢²á: 2013-04-04
- רҵ: ¼ÆËã»úÓ¦Óü¼Êõ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï
xzllxls: ½ð±Ò+5, ¡ï¡ï¡ïºÜÓаïÖú, ·Ç³£Ïêϸ£¬ºÜ¸Ðл£¡ 2016-08-02 23:56:24
xzllxls: ½ð±Ò+5, ¡ï¡ï¡ïºÜÓаïÖú, ·Ç³£Ïêϸ£¬ºÜ¸Ðл£¡ 2016-08-02 23:56:24
|
Ni Lao (ÀÍÄæ) https://www.cs.cmu.edu/~nlao/ PRA Code https://www.cs.cmu.edu/~nlao/code/2014.pra.zip Thesis Slides https://www.cs.cmu.edu/~nlao/publication/2012/defense.pdf |
5Â¥2016-08-02 18:41:24













»Ø¸´´ËÂ¥