检索结果-内蒙古大学图书馆

2007 IEEE International Conference on Web Services, ICWS 2007

作者： Huipeng, Guo Jinpeng, Huai Huan, Li Ting, Deng Yang, Li Zongxia, Du State Key Lab. of Software Development Environment School of Computer Beihang University Beijing China

ISBN: (纸本)0769529240

With the fast development of Internet and rapid acceptance of Web Service technology, more and more service resources have emerged. Service composition which integrates the functionalities of different services is a promising technique for developing applications across multiple organizations. However, in a distributed, dynamic and autonomous environment, such as a service composition-based system, the availability and reliability are big concerns in terms of nonfunctional properties. In this paper, we propose a novel service composition method, ANGEL, with the target of the improvement of system availability. We adopt redundant mechanism in ANGEL and propose a model to improve the property of the service availability. We model the multiple services selection problem based on redundant mechanism as a nonlinear mixed integer programming problem and therefore, we propose two heuristic algorithms to select multiple feasible services that have the same functions, but with better availability. In order to maintain the availability of composite services, we further introduce monitor and detection mechanisms. Through the comprehensive experiments, we find that our proposed techniques can indeed achieve better availability as expected. © 2007 IEEE.

关键词： Availability

来源：评论

学校读者我要写书评

暂无评论

Geo-WDBMS: An improved DBMS with the function of watermarking geographical data

引用

12th International Conference on Database Systems for Advanced Applications, DASFAA 2007

作者： Min, Huang Xiang, Zhou Jiaheng, Cao Zhiyong, Peng Computer School Wuhan University Wuhan 430072 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China

ISBN: (纸本)9783540717027

This paper focuses on the issue of geographical data's copyrights protection. A Geo-WDBMS has been built by embedding the watermarking functions into the inner code of the open source DBMS PostgreSQL. And its core watermarking mechanism is to insert and detect mark bits in the coordinates of the vertices in geographical objects using the methods of classifying and twice majority-voting. Further more, error correcting mechanism is used to enhance the resilience of the system and blind watermark is realized. Experiments on watermarking digital maps showed that the marked maps are inconspicuous and robust to various attacks. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

An approach to QoS-aware service selection in dynamic web service composition

An approach to QoS-aware service selection in dynamic web se...

引用

3rd International Conference on Networking and Services, ICNS 2007

作者： Yang, Yan Tang, Shengqun Xu, Youwei Zhang, Wentao Fang, Lina State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China Computer School Wuhan University Wuhan 430072 China

Web service composition has been recognized as a flexible way for resource sharing and application integration. For Web services providing similar functionality, Quality of Service (QoS) is the main factor to differentiate them. In this paper, the issue of QoS driven service selection in dynamic Web service composition is investigated. OWL-S is extended with a flexible QoS model to better facilitate service selection process. Based on different global constraints users set, the QoS-based service selection problems for composite services are divided into three categories. For each category, the mathematical model and its corresponding solving algorithm are put forward separately. Simulation experiments are conducted to show the validity and efficiency of the algorithms. © 2007 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Interactive point cloud blending by drag-and-drop

引用

Journal of Zhejiang University-Science A(Applied Physics & engineering) 2007年第10期8卷 1633-1641页

作者： ZOU Wan-hong?1, DING Zhan1, YE Xiu-zi1, CHEN Zhi-yang2 (1state key lab. of CAD and CG, school of computer Science and Technology, Zhejiang University, Hangzhou 310027, China) (2software College, Zhejiang University of Technology, Hangzhou 310014, China) State Key Lab. of CAD CG School of Computer Science Technology Zhejiang University Hangzhou 310027 China Software College Zhejiang University of Technology Hangzhou 310014 China

With the rapid development of 3D digital photography and 3D digital scanning devices, massive amount of point samples can be generated in acquisition of complex, real-world objects, and thus create an urgent need for advanced point-based processing and editing. In this paper, we present an interactive method for blending point-based geometries by dragging-and- dropping one point-based model onto another model’s surface metaphor. We first calculate a blending region based on the polygon of interest when the user drags-and-drops the model. Radial basis function is used to construct an implicit surface which smoothly interpolates with the transition regions. Continuing the drag-and-drop operation will make the system recalculate the blending regions and reconstruct the transition regions. The drag-and-drop operation can be compound in a constructive solid geometry (CSG) manner to interactively construct a complex point-based model from multiple simple ones. Experimental results showed that our method generates good quality transition regions between two raw point clouds and can effectively reduce the rate of overlapping during the blending.

关键词： Drag-and-drop Point cloud model Interactive blending Geometry modeling

来源：评论

学校读者我要写书评

暂无评论

A steep thermodynamical selection rule for evolutionary algorithms

A steep thermodynamical selection rule for evolutionary algo...

引用

7th International Conference on Computational Science, ICCS 2007

作者： Ying, Weiqin Li, Yuanxiang Peng, Shujuan Wang, Weiwu State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China School of Computer Science Wuhan University Wuhan 430079 China

ISBN: (纸本)9783540725893

The genetic algorithm (GA) often suffers from the premature convergence because of the loss of population diversity at an early stage of searching. This paper proposes a steep thermodynamical evolutionary algorithm (STEA), which utilizes a steep thermodynamical selection (STS) rule. STEA simulates the competitive mechanism between energy and entropy in annealing to systematically resolve the conflicts between selective pressure and population diversity in GA. This paper also proves that the rule STS has the approximate steepest descent ability of the free energy. Experimental results show that STEA is both far more efficient and much stabler than the thermodynamical genetic algorithm (TDGA). © Springer-Verlag Berlin Heidelberg 2007.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Polar: An efficient finding nearest neighbor algorithm for overlay network 2

Polar: An efficient finding nearest neighbor algorithm for o...

引用

2nd International Conference on Scalable Information Systems, InfoScale 2007

作者： Chen, Tan Sheng, Xiangzhi Shan, Baosong State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beijing University of Aeronautics and Astronautics Beijing China

ISBN: (纸本)9781595937575

Obviously, network proximity is an essential characteristic for overlay network construction. By selecting the nearest neighbor for the target node, large-scale distributed applications can decrease the communication cost and improve the performance significantly. Nevertheless, existing mechanisms for exploiting network proximity information are either inaccurate or low efficiency. In this paper, we present a novel and practical algorithm to find the nearest neighbor in overlay network, called Polar. Performing direct measurement based on the result of distance prediction using network coordinate, Polar achieves accuracy as while as it has low overhead. Meanwhile, our proposal does not rely on the static landmark so it has strong scalability and high robustness. Polar is a generic architecture that can be used for a variety of overlay network with different requirement. Copyright 200X ACM

关键词： Nearest neighbor Network coordinate Overlay network

来源：评论

学校读者我要写书评

暂无评论

Optimization of grid resource allocation combining fuzzy theory with generalized assignment problem

Optimization of grid resource allocation combining fuzzy the...

引用

6th International Conference on Grid and Cooperative Computing, GCC 2007

作者： Mingbiao, Li Xinmeng, Chen Feng, Jiao Zhijian, Wu Computer School Wuhan University Wuhan 430079 China Computer School of Science and Engineering Wenzhou University Wenzhou 325035 China State Key Laboratory of Software Engineering Wuhan University Wuhan China

ISBN: (纸本)0769528716

In the existing economy based models of grid resource allocation and management, just as commodity market model and posted price model, sharing resource is based on negotiating about the usage duration or time, the usage fee, QoS (Quality of Service) and some other items between the owner or his broker and the consumer of grid resource. That will cost so much time for a great deal of grid users no matter whether they are grid resource owners or grid resource consumers, which reduced the sharing efficiency in the grid environment and some time is even unaccepted. In this paper, the idea of GRS (Grid Resource Supermarket) is introduced. Posted price model based on GRS and optimization based on GAP (Generalized Assignment Problem) are proposed. Our scheme can help to solve the problem in the previous description. In the end an example is given to show the feasibility of this scheme. ©2007 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

UniNet Description of Dining Philosopher Problem

引用

Wuhan University Journal of Natural Sciences 2007年第6期12卷 1008-1012页

作者： DU Zhuomin HE Yanxiang ZHOU Guofu School of Computer Wuhan University Wuhan 430072 Hubei China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 Hubei China

The UniNet specification of Dining Philosopher Problem we presents not only is graphic and intuitionistic but also explicitly indicates the In the specification, static semantics and the the static properties are dynamic semantics. the recorder of the dynamic properties, and the dynamic properties are the track of the static properties change. Accordingly, Dining Philosopher Problem is formally verified by UniNet. Furthermore, the procedure of properties＇ verification is implemented through the graphic-related computing style.

关键词： static semantics dynamic semantics UNITY Petri net

来源：评论

学校读者我要写书评

暂无评论

Interactive browsing of large images on multi-projector display wall system

Interactive browsing of large images on multi-projector disp...

引用

12th International Conference on Human-computer Interaction, HCI International 2007

作者： Zhongding, Jiang Xuan, Luo Yandong, Mao Binyu, Zang Hai, Lin Hujun, Bao Computer Graphics Lab. Software School Fudan University Shanghai China State Key Lab. of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9783540731061

With the precision of data acquisition increases, large images that may occupy terabytes, become common in research and industry fields. Since multi-projector display wall systems can provide higher resolution, they becomes paramount to display the large images. In this paper, we present one large image viewing system designed for display wall system. Our system need not totally downloading the whole image data to each rendering node. It enables users to browse the out-of-core images in real time using data streaming techniques. In the system, the original out-of-core raw image is compressed and represented using one hierarchical structure in multi-resolution manner. We design one proxy architecture that interactive streams data from remote data server to all rendering nodes. Our system allows users to interactively pan, and zoom the large images with versatile graphical user interface. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Pseudo trust: Zero-knowledge based authentication in anonymous peer-to-peer protocols

Pseudo trust: Zero-knowledge based authentication in anonymo...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Lu, Li Han, Jinsong Hu, Lei Huai, Jinpeng Liu, Yunhao Ni, Lionel M. State Key Lab. of Information Security Graduate School Chinese Academy of Sciences Beijing China Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Kowloon Hong Kong School of Computer Science Beihang University Beijing China State Key Lab. of Software Developing Environment Beihang University Beijing China

ISBN: (纸本)1424409101

Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence, there exists an inherent tradeoff between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, instead of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the levels of security and anonymity in PT, and evaluate its performance using trace-driven simulations and a prototype implementation. The strengths of Pseudo Trust include the lack of need for a centralized trusted party or CA, high scalability and security, low traffic and cryptography processing overheads, and man-in-middle attack resistance. We aim for the Pseudo Trust design to be included in the P2P trust and anonymity context. © 2007 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：