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

4th Asian Conference on the Semantic Web, ASWC 2009

作者： Fan, Guisheng Yu, Huiqun Chen, Liqiong Liu, Dongmei Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai 201112 China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai 200235 China

ISBN: (纸本)3642108709

Service composition and related technologies have provided favorable means for building complex Web software systems. It may span multiple organizational units requires particular considerations on trustworthy issues. However, the distributive and heterogeneous characteristics of services make it hard to guarantee trustworthiness of service composition. This paper presents a method for analyzing dynamic trustworthy service composition according to the characteristics and requirements of service composition. Petri nets are used to precisely describe the composition process in order to describe the logic relation between different components. Based on this, the concept of trust matrix is given to represent the relationships between states. A trustworthy service composition strategy and its enforcement method are proposed. A case study of Travel Service demonstrates the feasibility of proposed method. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

PSF-constraints based iterative blind deconvolution method for image deblurring

PSF-constraints based iterative blind deconvolution method f...

引用

16th International Multimedia Modeling Conference on Advances in Multimedia Modeling, MMM 2010

作者： Mo, Xuan Jiao, Jun Shen, Chen Department of Automation State Key Laboratory of Intelligent Technology and Systems Tsinghua University Beijing China Dept. of Computer Science and Technology Nanjing University Nanjing China School of Software and Electronics Peking University Beijing China

ISBN: (纸本)3642113001

In recent years, Image Deblurring techniques have played an essential role in the field of Image Processing. In image deblurring, there are several kinds of blurred image such as motion blur, defocused blur and gaussian blur. Many methods to address this problem have been proposed by researchers in previous research, among which the iterative blind deconvolution (IBD) method is the most popular method to solve this problem. However, the convergence of this method is not ensured, and there is no effective method to choose a proper initial estimate image and PSF(point spread function). In this paper, we improve the iterative blind deconvolution method by adding several constraints, which could be the type or parameters range of the PSF, on the PSF in each iteration. Experiment results validate that, with the help of these newly added constraints, our method are more likely to converge and has better deblurring performance than the IBD. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： Optical transfer function

来源：评论

学校读者我要写书评

暂无评论

Removing local irregularities of triangular meshes with highlight line models

引用

science in China(Series F) 2009年第3期52卷 418-430页

作者： YONG JunHai DENG BaiLin CHENG FuHua WANG Bin WU Kun GU HeJin School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science University of Kentucky Lexington KY 40506-0046 USA Key Laboratory for Information System Security Ministry of Education of China Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China jianaxi Academy of Sciences. Nanchang 330029. China

The highlight line model is a powerful tool in assessing the quality of a surface. It increases the flexibility of an interactive design environment. In this paper, a method to generate a highlight line model on an arbitrary triangular mesh is presented. Based on the highlight line model, a technique to remove local shape irregularities of a triangular mesh is then presented. The shape modification is done by solving a minimization problem and performing an iterative procedure. The new technique improves not only the shape quality of the mesh surface, but also the shape of the highlight line model. It provides an intuitive and yet suitable method for locally optimizing the shape of a triangular mesh.

关键词： highlight lines mesh optimization shape modification model repair

来源：评论

学校读者我要写书评

暂无评论

SWCA: A secure weighted clustering algorithm in wireless ad hoc networks

SWCA: A secure weighted clustering algorithm in wireless ad ...

引用

2009 IEEE Wireless Communications and Networking Conference, WCNC 2009

作者： Zeng, Yingpei Cao, Jiannong Guo, Shanqing Yang, Kai Xie, Li State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong School of Computer Science and Technology Shandong University Jinan China

ISBN: (纸本)9781424429486

Clustering has been widely used in wireless ad hoc networks for various purposes such as routing, broadcasting and Qos. Many clustering algorithms have been proposed. However, most of them implicitly assume that nodes behave honestly in the clustering process. In practice, there might be some malicious nodes trying to manipulate the clustering process to make them serve as clusterheads, which can obtain some special power, e.g., eavesdropping more messages. In this paper we present a Secure Weighted Clustering Algorithm (SWCA). SWCA uses the Weighted Clustering Algorithm (WCA) for clustering and TELSA for efficiently authenticating packets. We propose a novel neighbor verification scheme to check whether the values of election-related features (e.g., node degree) are forged by malicious nodes. Also, we theoretically analyze the probability for a malicious node to tamper node degree without being detected and derive a lower bound on the probability. Finally, simulation results show that SWCA is secure but still has comparable performance with WCA. To the best of our knowledge, SWCA is the first algorithm considering the security of 1-hop type clustering (in this type only the clusterhead can communicate with ordinary members directly) in ad hoc networks. © 2009 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

On maximum stability with enhanced scalability in high-churn DHT deployment

On maximum stability with enhanced scalability in high-churn...

引用

38th International Conference on Parallel Processing, ICPP-2009

作者： Xie, Junfeng Li, Zhenhua Chen, Guihai Wu, Jie State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Engineering Florida Atlantic University Boca Raton FL 33431 United States

ISBN: (纸本)9780769538020

When applied in a commercial deployment, DHTbased P2P protocols face a dilemma: Although most real-world participants are so unstable that the maintenance overhead is prohibitively high, they must be effectively utilized due to the lack of stable participants. Thus, determining how to leverage unstable nodes to enhance system scalability and then maximize stability in high-churn scenarios becomes a substantial problem. This paper focuses on this topic, and our main findings are two folds: 1) we propose a homogeneous grouping scheme for scalability enhancement. Besides extending system storage capacity by admitting all nodes, it clusters homogeneous nodes together, deploys the inter- and intra-group connections distinctively, and tunes the number of groups, which aims to facilitate search efficiency;2) we further look into how to maximize stability under this scheme, which is formulated as the problem Maximum Stability of Grouping. It not only proves to be NP-hard, but also infeasible;therefore, we propose an approximated grouping approach and reduce it to an optimization problem that proves to be feasible. Simulation results exhibit that our grouping strategy effectively captures the stability- scalability tradeoff. Based on our proposed measurement metrics, it doubles the storage capacity of so-called GiantOnly strategy by incurring slightly more churn and search latency, and is about four times as stable as Chord with equal capacity and mild improvement in search efficiency. © 2009 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A Workflow Framework for Intelligent Service Composition

A Workflow Framework for Intelligent Service Composition

引用

International Conference on Grid and Pervasive Computing Workshops, GPC

作者： Xudong Song Wanchun Dou Wei Song Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing China

Generally, service composition and its evaluation are initiated by web services' functional and non-functional attributes. To select qualified services and compose them into a service composition framework manually is time-consuming and error-prone. In practice, it is a challenging endeavor to timely discover qualified services and develop a service composition schema. In view of this challenge, a workflow framework is presented in this paper for intelligently navigating service composition. The workflow framework consists of two primary processing modules: planning module and CSP (constraint satisfaction problems) solving module. Planning module aims at producing composite plans taking advantage of services' functional attributes. Moreover, CSP solving module aims at selecting an appropriate service, taking advantaging of services' non-functional attributes, from a group of qualified services that own the same functionality. This group of qualified services is instantiated from a service class predefined. Finally, a case study is presented to demonstrate the framework.

关键词： Web services Semantic Web technology planning Pervasive computing Laboratories computer science computer errors Navigation Process planning Availability

来源：评论

学校读者我要写书评

暂无评论

Tighter and convex maximum margin clustering

Tighter and convex maximum margin clustering

引用

12th International Conference on Artificial Intelligence and Statistics, AISTATS 2009

作者： Li, Yu-Feng Tsang, Ivor W. Kwok, James T. Zhou, Zhi-Hua National Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Maximum margin principle has been successfully applied to many supervised and semi-supervised problems in machine learning. Recently, this principle was extended for clustering, referred to as Maximum Margin Clustering (MMC) and achieved promising performance in recent studies. To avoid the problem of local minima, MMC can be solved globally via convex semi-definite programming (SDP) relaxation. Although many efficient approaches have been pro- posed to alleviate the computational burden of SDP, convex MMCs are still not scalable for medium data sets. In this paper, we propose a novel convex optimization method, LG-MMC, which maximizes the margin of opposite clusters via "Label Generation". It can be shown that LG-MMC is much more scalable than existing convex approaches. Moreover, we show that our convex relaxation is tighter than state-of-art con- vex MMCs. Experiments on seventeen UCI datasets and MNIST dataset show significant improvement over existing MMC algorithms.© 2009 by the authors.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Design pattern directed clustering for understanding open source code

IEEE International Conference on Program Comprehension

引用

IEEE International Conference on Program Comprehension 2009年 295-296页

作者： Han, Zhixiong Wang, Linzhang Yu, Liqian Chen, Xin Zhao, Jianhua Li, Xuandong State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu 210093 China

ISBN: (纸本)9781424439973

Program understanding plays an important role in the maintenance and reuse of open source code. Rapid evolving and bad documentation makes the understanding and reusing difficult. Design patterns are widely employed in the open source code. In this paper, we propose a design pattern directed clustering approach to help understand the structure of open source code. According to the approach, we have implemented a prototype tool. We also conducted an experiment on an open source system to evaluate it. © 2009 IEEE.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

SkipStream: A Clustered Skip Graph Based On-demand Streaming Scheme over Ubiquitous Environments

SkipStream: A Clustered Skip Graph Based On-demand Streaming...

引用

International Conference on Parallel Processing (ICPP)

作者： Qifeng Yu Tianyin Xu Baoliu Ye Sanglu Lu Daoxu Chen State Key Laboratory of Novel Software and Technology Department of Computer Science and Technology Nanjing University China

Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as well as the dynamic characteristics of both underlying network and user behavior. In this paper, we propose SkipStream, a skip graph based peer-to-peer (P2P) on-demand streaming scheme with VCR support to address the above challenges. In the design of SkipStream, we first group users into a set of disjoint clusters in accordance with their playback offset and further organize the resulted clusters into a skip graph based overlay network. In addition, we present a distributed on-demand streaming scheduling mechanism to minimize the impact of VCR operations and balance system load among nodes adaptively. The average search latency of SkipStream is O(log(N)) where N is the number of disjoint clusters. We also evaluate the performance of SkipStream via extensive simulations. Experimental results show that SkipStream outperforms early skip list based scheme DSL by reducing the search latency 20%-60% in average case and over 50% in worst case.

关键词： Video recording Delay Streaming media Scheduling Peer to peer computing DSL Network topology Network servers Scalability Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Dependence Analysis for C Programs with Combinability of Dataflow Facts under Consideration

引用

Wuhan University Journal of Natural sciences 2009年第4期14卷 321-326页

作者： QIAN Ju XU Baowen ZHOU Xiaoyu CHEN Lin SHI Liang College of Information Science and Technology NanjingUniversity of Aeronautics and Astronautics Nanjing 210016Jiangsu China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 Jiangsu China Department of Computer Science and Technology NanjingUniversity Nanjing 210093 Jiangsu China School of Computer Science and Engineering SoutheastUniversity Nanjing 211189 Jiangsu China Microsoft China Research and Development Group Beijing100080 China

To avoid the precision loss caused by combining data- flow facts impossible to occur in the same execution path in dependence analysis for C programs, this paper first proposes a flow-sensitive and context-insensitive points-to analysis algorithm and then presents a new dependence analysis approach based on it. The approach makes more sufficient consideration on the executa- ble path problem and can avoid invalid combination between points-to relations and between points-to relations and reaching definitions. The results of which are therefore more precise than those of the ordinary dependence analysis approaches.

关键词： pointer analysis dependence analysis executable path

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：