李明禄
主要研究兴趣包括Web Services与网格计算、多媒体计算与生物医学信息学、物流与海量空间信息处理。
个性化签名
- 姓名:李明禄
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师
- 职称:-
-
学科领域:
计算机应用
- 研究兴趣:主要研究兴趣包括Web Services与网格计算、多媒体计算与生物医学信息学、物流与海量空间信息处理。
李明禄,博士、教授、博士生导师,现为上海交通大学计算机科学与工程系副主任、网格计算中心主任、现代物流研究中心副主任,教育部中国教育科研网格ChinaGrid计划专家组专家、“计算流体力学网格”责任专家,上海市科委技术预见专家、信息技术领域计算机软硬件主题专家、“信息网格及其典型应用研究(ShanghaiGrid)”重大项目首席专家,上海高校网格技术E-研究院学术委员会委员,上海市普陀区人民政府科技专家组专家,IEEE计算机学会服务计算分会(Technical Steering Committee for Services Computing)执行委员会委员、大中华区主席,中国网格论坛执行委员会委员,中国计算机学会软件工程专业委员会委员,中国计算机学会对外联络部委员,中国共创软件联盟理事,上海市计算机学会多媒体专委副主任委员,国际学术期刊《International Journal of Grid and Utility Computing》副主编,《 International Journal of Web Services Research》编委。 1985年毕业于解放军信息工程大学电子技术学院计算机工程专业。1993年免试进入上海交通大学计算机软件专业攻读博士学位,导师为孙永强教授和盛焕烨教授,1996年毕业获博士学位,2000年获上海交通大学优秀博士学位论文奖。随后进入上海交通大学控制科学与工程博士后流动站, 2001年获上海交通大学优秀博士后奖。2001年2-7月曾赴香港城市大学信息系统学系访问。主要研究兴趣包括Web Services与网格计算、多媒体计算与生物医学信息学、物流与海量空间信息处理。主持或参加过国家自然科学基金、国家863计划、国家973计划、国家“十五”科技攻关计划、教育部ChinaGrid计划、上海市科委、上海市教委等多项国家及省部级科研项目。在Computers & Graphics、Journal of Computer Science and Technology等国内外重要学术期刊和IEEE、LNCS等重要学术会议上发表论文100余篇。2002年被上海市教委、上海市教育发展基金会授予“曙光学者”称号。
-
主页访问
2495
-
关注数
0
-
成果阅读
457
-
成果数
12
【期刊论文】VChord: Constructing Peer-to-Peer Overlay Network by Exploiting Heterogeneity*
李明禄, Feng Hong, Minglu Li, Xinda Lu, Yi Wang, Jiadi Yu, and Ying Li
(Eds.): EUC 2004, LNCS 3207, pp. 1096-1106, 2004.,-0001,():
-1年11月30日
High heterogeneity is an unignoring factor for large-scale peer-to-peer system which leads to the born of VChord. VChord is a peer-to-peer overlay network constructed on Chord aimed to exploit heterogeneity. The fundamental idea of VChord is to expand the use of virtual nodes of Chord to describe the heterogeneity of the real nodes' capability, working with its special lookup algorithm and load transfer scheme to make full use of information of the virtual nodes. The simulation shows that VChord has achieved better routing efficiency and load distribution than standard Chord protocol.
Peer-to-peer,, heterogeneity,, routing efficiency,, load balance,, Chord,, Vchord
-
32浏览
-
0点赞
-
0收藏
-
0分享
-
93下载
-
0评论
-
引用
【期刊论文】ShanghaiGrid in Action: The First Stage Projects towards Digital City and City Grid1
李明禄, Minglu Li, Hui Liu, Changjun Jiang, Weiqin Tong, Aoying Zhou, Yadong Gui, Hao Zhu, Shui Jiang, Ruonan Rao, Jian Cao, Qianni Deng, Qi Qian, and Wei Jin
(Eds.): GCC 2003, LNCS 3032, pp. 616-623, 2004.,-0001,():
-1年11月30日
The nearest goal of ShanghaiGrid is to going to connect all supercomputers in this metropolis together to form a sharing environment for massive storage and grid computing. The first stage projects of ShanghaiGrid comprise four sub-projects, including 1) research on environment, protocols and standards of information gird infrastructure; 2) development of system software for information grid and establishment of four major grid nodes; 3) development of peer-to-peer based virtual research platform; 4) research on the application of grid based traffic-jam control and guidance. This paper introduces the background of ShanghaiGrid, provides a glimpse at features and challenges of its sub-projects, and summarizes the general goal of them.
-
31浏览
-
0点赞
-
0收藏
-
0分享
-
82下载
-
0评论
-
引用
【期刊论文】ShanghaiGrid: A Grid Prototype for Metropolis Information Services
李明禄, Minglu Li, Min-You Wu, Ying Li, Linpeng Huang, Qianni Deng, Jian Cao, Guangtao Xue, Chuliang Weng, Xinhua Lin, Xinda Lu, Changjun Jiang, Weiqin Tong, Yadong Gui, Aoying Zhou, Xinhong Wu, and Shui Jiang
(Eds.): APWeb 2005, LNCS 3399, pp. 1033-1036, 2005.,-0001,():
-1年11月30日
The goal of ShanghaiGrid is providing information services to the people. It aims at constructing a metropolitan-area information service infrastructure and establishing an open standard for widespread upper-layer applications from both communities and the government. A typical application named as Traffic Information Grid is discussed in detail.
-
35浏览
-
0点赞
-
0收藏
-
0分享
-
81下载
-
0评论
-
引用
【期刊论文】Semantics and Formalizations of Mission-Aware Behavior Trust Model for Grids
李明禄, Minglu Li, Hui Liu, Lei Cao, Jiadi Yu, Ying Li, Qi Qian, and Wei Jin
(Eds.): GCC 2003, LNCS 3032, pp. 883-890, 2004.,-0001,():
-1年11月30日
Trust model is an important component of gird security model and can be classified as mission-unaware identity trust model, mission-aware identitytrust model, mission-unaware behavior trust model and mission-aware behavior trust model. All of them could be regarded as projections of missionaware behavior trust model, by which authorization depends on not only the trust but also the cost and quantity of the mission. This paper proposes a formal description of this trust model by using abstract state machine (ASM). It will facilitate us understanding its semantics and accurate definitions, and bridging the gaps between de facto industry standards and this trust model. These formalizations are vertical refinements of the ASM based ground model for grids and could be easily jointed on it.
-
50浏览
-
0点赞
-
0收藏
-
0分享
-
84下载
-
0评论
-
引用
【期刊论文】Resource Management and Scheduling for High Performance Computing Application Based on WSRF
李明禄, Chuliang Weng, Minglu Li, and Xinda Lu
(Eds.): APWeb 2005, LNCS 3399, pp. 718-729, 2005.,-0001,():
-1年11月30日
In this paper, we challenge the issue of resource management and scheduling in the grid context, which is compliant with WS-Resource Framework. Firstly, we focus on the high performance application, and model the large-scale scientific computing problem that can be decomposed into multiple sub-problems, which evolves to be represented by a DAG. Then, a hierarchical infrastructure for resource management in the grid context is proposed in accordance with the specifications of WS-Resource Framework. Thirdly, we discuss the scheduling issue in the presented scenario and present a modification of the DLS algorithm. At last we analyze the presented modified algorithm with simulation experiments.
-
70浏览
-
0点赞
-
0收藏
-
0分享
-
101下载
-
0评论
-
引用
【期刊论文】Isosurface-Based Level Set Framework for MRA Segmentation
李明禄, Yongqiang Zhao and Minglu Li
(Eds.): ICIAR 2004, LNCS 3212, pp. 116-123, 2004.,-0001,():
-1年11月30日
Segmentation is one of the most important and difficult procedures in medical image analysis and in its clinical applications; and blood vessels are especially difficult to segment. In this paper, we propose an isosurface-based level set framework to extract vasculature tree from magnetic resonance angiography (MRA) volumes. First, we process the extracted isosurface of MRA via the surface normal vectors; then use canny edge detection to compute image-based speed function for level set evolution to refine the processed isosurface for the exact segmentation. Results on cases demonstrate it is the mostly accuracy and efficiency of the approach.
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
57下载
-
0评论
-
引用
【期刊论文】Integrating Grid Services for Enterprise Applications
李明禄, Feilong Tang and Minglu Li
(Eds.): GCC 2004, LNCS 3251, pp. 1009-1012, 2004.,-0001,():
-1年11月30日
Integrating heterogeneous systems in the "plug and play" way is a goal of distributed computing researchers. In this paper1, we propose a general platform to integrate Grid services for enterprise applications, and present implementation mechanisms of its core components. The platform can handle transaction, workflow and security to satisfy enterprise application requirements. Moreover, the platform is fully built on open standards so that it has some good properties such as scalability, adaptability and portability.
-
37浏览
-
0点赞
-
0收藏
-
0分享
-
52下载
-
0评论
-
引用
李明禄, Feng Hong, Minglu Li, Xinda Lu, Jiadi Yu, Yi Wang, and Ying Li
(Eds.): GCC 2004, LNCS 3251, pp. 626-633, 2004.,-0001,():
-1年11月30日
Routing efficiency is the critical issue when constructing peerto-peer overlay. A peer-to-peer overlay, called HP-Chord, is illustratedin this article which aims to achieve better routing efficiency. HP-Chordis built on the basis of Chord overlay, which makes use of the heterogeneity of the bandwidth of the nodes and exploits the proximity of the underlying network. The simulation shows that HP-Chord has achieved better routing efficiency than standard Chord overlay on two aspects, which are lower number of hops and lower RDP per message routing.
-
37浏览
-
0点赞
-
0收藏
-
0分享
-
59下载
-
0评论
-
引用
【期刊论文】Basic Mathematical Properties of Multiparty Joint Authentication in Grids*
李明禄, Hui Liu and Minglu Li
(Eds.): CIS 2004, LNCS 3314, pp. 172-181, 2004.,-0001,():
-1年11月30日
This paper introduces the semantic of Multiparty Joint Authentication (MJA) into the authentication service, which is to find simpli fied or optimal authentication solutions for all involved principals as a whole instead of to authenticate each pair of principals in turn. MJA is designed to support multiparty security contexts in grids with a speci fied, understood level of confidence and reduce the time cost of mutual authentications. Graph theory model is employed to define MJA, and analyze its mathematical properties. Two algorithms to find an n-principal, n-order MJA solution are also presented and proved.
-
21浏览
-
0点赞
-
0收藏
-
0分享
-
48下载
-
0评论
-
引用
【期刊论文】An Ontology-Based Model for Grid Resource Publication and Discovery*
李明禄, Lei Cao, Minglu Li, Henry Rong, and Joshua Huang
(Eds.): GCC 2004, LNCS 3251, pp. 448-455, 2004.,-0001,():
-1年11月30日
Resource management system is the core component of a Grid system. It has two important functions: resource publication and discovery. This paper presents an ontology-based model for Grid Resource Publication and Discovery (GRPD). We adopt multiple domainspeci fic registries to manage corresponding resources of a Virtual Organization (VO) in order to obtain high GRPD efficiency. Resource descriptions and resource requests are all based on domain-specific ontology. The ontology-based matchmaker of the domain-specific registry plays the important role in resources selection. The "Index" node of a VO hosts the general registry. Other domain-specific registries are distributed in the VO. This is a two-level registry mechanism. A large-scale Grid system may contain many VOs. "Index" nodes from various VOs connect to each other in the peer-to-peer mode instead of the hierarchical mode.
-
40浏览
-
0点赞
-
0收藏
-
0分享
-
100下载
-
0评论
-
引用