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

5th International Conference on Embedded and Ubiquitous Computing, EUC 2008

作者： Huang, Yu Ma, Xiang Tao, Xianping Cao, Jiannong Lu, Jian State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9780769534923

Context-awareness is a key issue in pervasive computing. Context-aware applications are prone to the context consistency problem, where applications are confronted with conflicting contexts and cannot decide how to adapt themselves. In pervasive computing environments, users are often willing to accept certain degree of context inconsistency, as long as it can reduce the consistency maintenance cost, e.g., query delay and battery power. However, existing consistency maintenance schemes do not enable the users to make such tradeoffs. To this end, we propose the Probabilistic Consistency Checking for Pervasive Context (PCCPC) algorithm. Detailed performance analysis shows that PCCPC enables the users to check consistency over arbitrarily specified ratio of context. We also conduct experiments to study the cost reduced by probabilistic checking. The analytical and the experimental results show that PCCPC enables the users to efficiently make tradeoffs between context consistency and the associated checking cost. © 2008 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Functional Ontology of Routing Reputation for MANET

Functional Ontology of Routing Reputation for MANET

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Wei Guo Zhong-Wei Xiong Ren-Zuo Xu College of Computer Science Wuhan University Wuhan China State Key Lab. of Software Engineering Wuhan University Wuhan China

The nature of mobile ad hoc networks make the routing is highly dependent on cooperate behavior between nodes, and using reputation mechanism can enforce cooperation among the nodes to prevent selfish behavior. This article proposes a functional ontology for reputation routing mechanisms base on node behavior. In this ontology, the functional structures and conceptualize that compose the reputation routing mechanism are identified. At the end of this paper, an ontological view of routing reputation query also has been proposed to describe the inner relationships of the reputation routing discovery, which try to prove the dependability of routing relationships that established between independent nodes based on their routing reputation.

关键词： Ontologies Mobile ad hoc networks Routing protocols software engineering Collab.ration Educational inst.tutions computer science Ad hoc networks Relays Mechanical factors

来源：评论

学校读者我要写书评

暂无评论

Mesh-guided optimized retexturing for image and video

Mesh-guided optimized retexturing for image and video

引用

作者： Guo, Yanwen Sun, Hanqiu Peng, Qunsheng Jiang, Zhongding IEEE National Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong State Key Lab. CAD and CG Zhejiang University Hangzhou 310058 China Software School Fudan University Shanghai 201203 China

This paper presents a novel approach for replacing textures of specified regions in the input image and video using stretch-based mesh optimization. The retexturing results have the similar distortion and shading effect conforming to the unknown underlying geometry and lighting conditions. For replacing textures in a single image, two important steps are developed: The stretch-based mesh parameterization incorporating the recovered normal information is deduced to imitate perspective distortion of the region of interest;the Poisson-based refinement process is exploited to account for texture distortion at fine scale. The luminance of the input image is preserved through color transfer in YCbCr color space. Our approach is independent of the replaced textures. Once the input image is processed, any new textures can be applied to efficiently generate the retexturing results. For video retexturing, we propose key-frame-based texture replacement extended and generalized from the image retexturing. Our approach repeatedly propagates the replacement results of key frames to the rest of the frames. We develop the local motion optimization scheme to deal with the inaccuracies and errors of robust optical flow when tracking moving objects. Visibility shifting and texture drifting are effectively alleviated using graphcut segmentation algorithm and the global optimization to smooth trajectories of the tracked points over temporal domain. Our experimental results showed that the proposed approach can generate visually pleasing results for retextured images and video. © 2008 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Study of software fault tolerance system evaluation strategy

引用

Wuhan Daxue Xuebao (Xinxi Kexue Ban)/ Geomatics and Information science of Wuhan University 2008年第10期33卷 1018-1021页

作者： Liu, Xin Yin, Qian Guo, Ping Lab. of Pattern Recognition and Intelligent System Beijing Normal University 19 Xinjiekou Beijing 100875 China State Key Laboratory of Computer Science Institute of Software CAS 4 Zhongguancun Beijing 100080 China

software fault tolerance technique is used to ensure high reliability. In order to evaluate the quality of fault-tolerant systems, expected execution time and cost must be considered. A new evaluation strategy is proposed to evaluate, evaluating the system with three groups of quality factors, which is the capability, the time and the cost. By using them, the system's integrative quality factor can be calculated. When applying this strategy, we compare the quality of software systems which is consist of different fault-tolerant components. The results can be used to improve fault-tolerant system. To achieve the required optimal result, several optimization schemes are given to meet different project demands.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Formal semantics for component assembly pattern of software architecture

Formal semantics for component assembly pattern of software ...

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Wei Guo Sheng Xu Ren Zuo Xu College of Computer Science Wuhan University Wuhan China International Software School Wuhan University Wuhan China State Key Lab. of Software Engineering Wuhan University Wuhan China

The performance and reliability of component-based software architectures rely fundamentally on the quality of the components and the configuration that the system is composed. This paper analysis the assembly patterns and interaction behaviors of components at first, then an ontology of the component¿s operation is proposed, which the interactions of components are formalized and abstracted. Based on the in-depth analysis of the component assembly patterns, this paper try to define the assembly patterns in architecture on process algebra theory, which can establish a practical means of describing and analyzing the component assembly pattern in the software architectures. Furthermore, the architecture algebra model has been built, which can set a theoretical foundation for the further research on analysis and validation of architecture.

关键词： software architecture computer architecture Pattern analysis Assembly systems software quality Algebra software systems Application software Educational inst.tutions computer science

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards location-aware topology in both unstructured and structured P2P systems

Towards location-aware topology in both unstructured and str...

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Qiu, Tongqing Chen, Guihai Ye, Mao Chan, Edward Zhao, Ben Y. State Key Lab. of Novel Software Nanjing University Department of Computer Science City University of Hong Kong Department of Computer Science UC Santa Barbara

ISBN: (纸本)076952933X

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a location-aware topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogeneous environment where nodes have different processing capabilities. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Deforming surface simplification based on feature preservation

Deforming surface simplification based on feature preservati...

引用

6th International Conference of Entertainment Computing, ICEC 2007

作者： Shixue, Zhang Enhua, Wu Dept. of Computer and Information Science University of Macau Macao China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)3540748725

In computer graphics, methods for mesh simplification are common. However, most of them focus on static meshes, only few works have been proposed for simplifying deforming surfaces. In this paper, we propose a new method for the multiresolution representation of time-varying meshes based on deformation area and feature preservation. Our method uses the famous QEM (quadric error metric) as our basic metric. The idea is to modify the edge collapse cost by adding the deformation and sharp feature weight to the aggregated quadrics errors when computing the unified edge contraction sequence, then adjust this sequence slightly for each frame to get a minimum geometry distortion. Our approach is fast, easy to implement, and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame. © ERIP International Federation for Information Processing 2007.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

A kind of shape similarity measure methods and the performance evaluation

引用

Journal of Computational Information Systems 2007年第5期3卷 2057-2062页

作者： Hong, Zhiling Wang, Beizhan Jiang, Qingshan Wang, Shoujue Department of Computer Science Xiamen University Fujian 361005 China School of Software Xiamen University Fujian 361005 China Key Laboratory for Intelligent Information Technology Fujian 361005 China Lab. of Artificial Neural Networks Inst. of Semiconductors CAS Beijing 100083 China

Shape similarity measure is an important and difficult problem in computer vision and has been extensively studied for decades. In this paper, we propose a kind of shape similarity measure methods based on partition block statistic According to the difference of partition methods, we extend the idea into eight shape similarity measure methods. Zernike moments and Hu moments methods are also included for performance comparison. Shape retrieval experiments have been conducted on the MPEG-7 Core Experiment CE-Shape-1 database of 1400 images which illustrate the performance of the ten algorithms.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of point-tree structured genetic programming in symbolic regression and parameter identification

引用

Journal of Harbin inst.tute of Technology (New Series) 2007年第SUPPL. 2期14卷 106-109页

作者： Wang, Weiwu Li, Yuanxiang Tong, Yala Dai, Zhifeng State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China School of Science Hubei University of Technology Wuhan 430068 China School of Computer Wuhan University Wuhan 430079 China

Point-Tree Structured Genetic Programming (PTGP) is designed for solving discontinuous function's regression problem. In this paper, we apply this method to identify the discontinuous parameter in a parabolic differential equation, and then compare the performance of PTGP in the direct regression task and the identification task. The results show that PTGP is a robust problem solver. It can be easily adapted to the identification task and automatically find the way which leads to the optimal solution. In the performance comparison, PTGP performs a little better in the direct regression than the identification. We suggest that it is caused by the complexity of problem itself, that is, the identification task is more complex than the regression task.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：