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

10th IEEE International Conference on computer Aided Design and computer Graphics(第十届CAO/Graphics国际会议)

作者： Yanci Zhang Hanqiu Sun Enhua Wu State Key Lab.of Computer Science Institute of SoftwareChinese Academy of Sciences Department of Computer Science and EngineeringThe Chinese University of Hong Kong Faculty of Science and TechnologyUniversity of Macau

In this paper,we propose a novel method that represents the highly-complex point sets by clustering the points to normal-mapped B-spline surfaces (NBSs). The main idea is to construct elaborate normal maps on simple surfaces for the realistic rendering of complex point-set models. Based on this observation,we developed the coarse,normal-mapped B-spline surfaces to approximate the original point datasets with fine surface details. In our algorithm,a genetic clustering algorithm is proposed to automatically segment the point samples into several clusters according to their statistical properties,and a network of B-spline patches with normal maps are constructed according to the clustering results. Our experimental results show that this representation facilitates the modeling and rendering of complex point sets without losing the visual qualities.

关键词： Spline Surface reconstruction Signal processing algorithms Surface fitting Clustering algorithms computer science Sampling methods Frequency Sun Genetics

来源：评论

学校读者我要写书评

暂无评论

The tilt cursor: Enhancing stimulus-response compatibility by providing 3D orientation cue of pen

Conference on Human Factors in Computing Systems - Proceedin...

引用

Conference on Human Factors in Computing Systems - Proceedings 2007年 303-306页

作者： Tian, Feng Ao, Xiang Wang, Hongan Setlur, Vidya Dai, Guozhong Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences P.O.Box 8718 Beijing China State Key Lab. of Computer Science P.O.Box 8718 Beijing China Nokia Research Palo Alto 975 Page Mill Road Palo Alto CA United States

ISBN: (纸本)1595935932;9781595935939

In order to improve stimulus-response compatibility of touchpad in pen-based user interface, we present the tilt cursor, i.e. a cursor dynamically reshapes itself to providing the 3D orientation cue of pen. We also present two experiments that evaluate the tilt cursor?s performance in circular menu selection and specific marking menu selection tasks. Results show that in a specific marking menu selection task, the tilt cursor significantly outperforms the shape-fixed arrow cursor and the live cursor [4]. In addition, results show that by using the tilt cursor, the response latencies for adjusting drawing directions are smaller than that by using the other two kinds of cursors. © Copyright 2007 ACM.

关键词： Human computer interaction Sensory perception Three dimensional computer graphics Ubiquitous computing Menu selection task Stimulus response compatibility

来源：评论

学校读者我要写书评

暂无评论

Moving Schemes for Mobile Sinks in Wireless Sensor Networks

Moving Schemes for Mobile Sinks in Wireless Sensor Networks

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Yanzhong Bi Jianwei Niu Limin Sun Wei Huangfu Yi Sun Institute of Software Chinese Academy and Sciences Beijing China School of Computer Science and Engineering Beihang University Beijing China College of Information Sciences and Engineering Graduate University of Academy of Sciences Beijing China

In a wireless sensor network for data-gathering applications, if all network data congregate to a stationary sink node hop by hop, the sensor nodes near the sink have to consume more energy on forwarding data for other nodes, which probably causes the early function loss of the sensor network. Employing a mobile sink can alleviate the hotspot problem and balance the energy consumption among the sensor nodes. In this paper, we propose two autonomous moving schemes for the mobile sink. In our schemes, the sink makes moving decisions without complete knowledge of network topology and the energy distribution of all sensor nodes. We evaluated the performance of our moving schemes by simulation and the results show that both the two schemes can extend the network lifetime prominently.

关键词： Wireless sensor networks Energy consumption Sun Research and development Relays Energy efficiency Bismuth computer science Educational institutions Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Perfect Concurrent Signature Protocol

Perfect Concurrent Signature Protocol

引用

ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Zhenjie Huang Rufen Huang Xuanzhi Lin Department of Computer Science and Engineering Zhangzhou Normal University Fujian China State Key Laboratory of Information Security Institute of Software Chinese Academy and Sciences Beijing China

The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.

关键词： Protocols Concrete software engineering Artificial intelligence Distributed computing computer science Laboratories Information security Certification

来源：评论

学校读者我要写书评

暂无评论

An Combination Approach to Tackling Semantic Conflicts Based on RDF Model

An Combination Approach to Tackling Semantic Conflicts Based...

引用

2007年第三届语义和知识网格国际会议(Third International Conference on Semantics,Knowledge,and Grid)(SKG 2007)

作者： Yinglong Ma Beihong Jin School of Computer Science and Technology North China Electric Power University Beijing 102206 P.R. Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences P.O.Box

Within Semantic Web environments, ontologies have been adopted as their conceptual backbone. An important task for Web information integration and sharing is to resolve semantic conflicts because of semantic heterogeneity and information incompleteness. But it is rather difficult for ontology engineers to integrate Web information including semantic heterogeneity and conflicts. In this paper, a combined approach is proposed for detecting and handling semantic conflicts from ontology information. Using rule reasoning based on RDF model theory, we can automatically check where semantic conflicts probably exist, and further locate so called conflict points of ontology information. Then based on Bayesian network method, semantic conflicts can be controlled and avoided by computing semantic overlap and its posterior probabilities of concept nodes from conflict points. Users can issue semantic based query by interaction interface and achieve information sharing with conflicts and uncertainty.

关键词： Semantic Web Ontology Semantic conflicts Semantic based query

来源：评论

学校读者我要写书评

暂无评论

Partial Verification of software Components: Heuristics for Environment Construction

Partial Verification of Software Components: Heuristics for ...

引用

Euromicro Conference on software engineering and Advanced Applications (SEAA)

作者： Pavel Parizek Frantisek Plasil Faculty of Mathematics and Physics Department of Software Engineering Charles University Prague Czech Republic Institute of Computer Science Academy of Sciences슠of the슠Czech Republic Czech Republic

Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single component typically comprises a smaller state space than the whole system. We present a technique that mitigates the problem of state explosion in code checking of primitive components with the Java PathFinder in case the checked property is absence of concurrency errors. The key idea is to reduce parallelism in the calling protocol on the basis of the information provided by static analysis searching for concurrency-related patterns in the component code; by a heuristic, some of the pattern instances are denoted as "suspicious". Then, the environment (needed to be available since Java PathFinder checks only complete programs) is generated from a reduced calling protocol so that it exercises in parallel only those parts of the component's code that likely contain concurrency errors.

关键词： Protocols Object oriented modeling Java Explosions State-space methods Concurrent computing software engineering Parallel processing Mathematics Physics

来源：评论

学校读者我要写书评

暂无评论

MHH: A Novel Protocol for Mobility Management in Publish/Subscribe Systems

MHH: A Novel Protocol for Mobility Management in Publish/Sub...

引用

International Conference on Parallel Processing (ICPP)

作者： Jinling Wang Jiannong Cao Jing Li Jie Wu Department of Computing Hong Kong Polytechnic University Hong Kong China Institute of Software Chinese Academy and Sciences China Department of Computer Science and Engineering Florida Atlantic University USA

Mobility management is an important issue for publish/subscribe systems to support mobile clients. The objectives of mobility management for publish / subscribe are to achieve short handoff delay and low message overhead, while at the same time guaranteeing reliable message delivery. Although mobility management has been extensively studied, the indirect communication style of publish/subscribe systems brings new challenges in designing mobility management solutions. In this paper, we propose a reliable and high-performance mobility management protocol, called multi-hop handoff (MHH) protocol, which sufficiently meets the requirements of publish/subscribe systems. A prototype was implemented for the MHH protocol and experiments were performed to compare the performance of MHH with two representative existing protocols. The experimental results demonstrate the efficiency improvement made by the proposed MHH protocol over the existing protocols.

关键词： Mobile radio mobility management Subscriptions Mobile computing Mobile communication Handheld computers Delay Technology management Routing protocols computer science Manufacturing industries

来源：评论

学校读者我要写书评

暂无评论

PRACTICAL PARAMEERS DESIGN FOR GABOR FILERS WITH APPLICATION TO FACE RECOGNITION

PRACTICAL PARAMEERS DESIGN FOR GABOR FILERS WITH APPLICATION...

引用

2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

作者： YING-NAN ZHAO JING-YU YANG CHUAN-CAI LIU ZHONG JIN XIAN-QUAN MENG School of Computer Science & Technology Nanjing University of Science & Technology Nanjing 210094 College of Software Nankai University Tianjin 300071 China National Computer Virus Emergency Res Department of Equipment Command and Management Academy of Armored Force Engineering Beijing 10007

Feature extraction works using Gabor filters have shown that recognition performance is heavily affected by the filters parameters *** paper investigates methods in this domain and proposes a practical *** main contribution of this paper includes: (1) On the basis of the obvious directional characteristics in Gabor features, the filter-bank parameters design is transformed to a single filter *** algorithm is simple and tractable in computing.(2) A model is presented to evaluate the Gabor features' discrimination based on the Fisher *** methods are evaluated and compared on the NUST603 face *** results illustrate the availability and efficiency.

关键词： Gabor filter Feature extraction Fisher criterion Face recognition

来源：评论

学校读者我要写书评

暂无评论

Runtime Support for Advanced Component Concepts

Runtime Support for Advanced Component Concepts

引用

International Conference on software engineering Research, Management and Applications (SERA)

作者： Tomas Bures Petr Hnetynka Frantisek Plasil Jan Klesnil Ondrej Kmoch Tomas Kohan Pavel Kotrc Department of Software Engineering Faculty of Mathematics and Physics Charles University Prague Czech Republic Institute of Computer Science Academy of Sciences슠of the슠Czech Republic Prague Czech Republic School of Computer Science and Informatics University College Dublin Dublin Ireland

Component-based development has become a recognized technique for building large scale distributed applications. Although the maturity of this technique, there appears to be quite a significant gap between (a) component systems that are rich in advanced features (e.g., component nesting, software connectors, versioning, dynamic architectures), but which have typically only poor or even no runtime support, and (b) component systems with a solid runtime support, but which typically possess only a limited set of the advanced features. In our opinion, this is mainly due to the difficulties that arise when trying to give proper semantics to the features and reify them in development tools and an runtime platform. In this paper, we describe the implementation of the runtime environment for the SOFA 2.0 component model. In particular, we focus on the runtime support of the advanced features mentioned above. The described issues and the solution are not specific only to SOFA 2.0, but they are general and applicable to any other component system aiming at addressing such features.

关键词： Application software software engineering computer science Buildings Large-scale systems Runtime environment Runtime library Containers Conference management Research and development management

来源：评论

学校读者我要写书评

暂无评论

Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols

Pseudo Trust: Zero-Knowledge Based Authentication in Anonymo...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

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

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.

关键词： Authentication Peer to peer computing Protocols Knowledge management Identity management systems Performance analysis Information security Analytical models Virtual prototyping Scalability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：