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

4th IFIP TCI2 International Conference on Intelligent Information Processing, IIP 2006

作者： JiSheng, Hao Qing, He Zhongzhi, Shi College of Computer Science Yanan University Shanxi Yanan 7l6000 China Key Laboratory of Intelligence Information Processing Institute of Computing Technology Chinese Academy of Science Beijing 100080 China

ISBN: (纸本)9780387446394

Principal curve pass througli the middle of a multidimensional data set. to express the distributing shape of the points in the data set, we model principal curve for it. The new method of modeling the complex principal curve, based on B-spline network, is proposed. This method combines the polygonal line algorithm of learning principal curve with B-spline network. At one time, the algorithm finding a bifurcate point of the complex principal curve is presented. Our experimental results on simulate data demonstrate that it is feasible and effective.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Content-based 3-D Shape Retrieval for Pervasive computing

Content-based 3-D Shape Retrieval for Pervasive Computing

引用

International Conference on Pervasive computing and Applications (ICPCA)

作者： Dong Xu Hua Li Zongkai Lin Chinese Academy of Sciences China Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Science. lihua@*** Key Laboratory of Intelligent Information Processing Chinese Academy and Sciences China

3D models are a new kind of cross-media resource which can be frequently seen in the network. Since the amount of them is very huge now, content-based retrieval can help to recognize a certain object or retrieve similar ones from the giant database. This paper presents a new method for deriving 3D moment invariants and uses them as shape descriptors for the representation of 3D models. They are insensitive to surface noise and can be used in pervasive environment conveniently. We also illustrate how to build up experimental system and simulate 3D shape retrieval in wireless environment

关键词： Shape Content based retrieval Pervasive computing Information retrieval Humans Internet Application software Laboratories Intelligent networks computer networks

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Scheme for Trust Relationship Establishment in Ubiquitous Sensor Networks

A Lightweight Scheme for Trust Relationship Establishment in...

引用

International Conference on computer and Information technology (CIT)

作者： Lei Xie Yongjun Xu Xiaowei Li Yuefei Zhu Institute of Information Engineering Information and Engineering University Zhengzhou China Advanced Test Technology Laboratory Key Laboratory of Computer System and Architecture Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

Ubiquitous sensor networks are application oriented system, which are composed of a large number of cooperative sensor nodes. The identification of individual sensor node is important especially for some security-sensitive applications. In this paper, we focus on the establishment of trust relationship among wireless sensor nodes, and try to combine the message authentication and identity authentication as a countermeasure to hostile attack. Accompanied with a simple lightweight key pre-distribution algorithm, in which each node sends only one message, we propose a lightweight trust relationship establishing scheme for ubiquitous sensor networks. The new scheme, which works without a trusted authority in the network, is not only concise in format but effective in practice to ensure network trusted and secure.

关键词： Authentication Protocols Pervasive computing Wireless sensor networks Information security Sensor systems and applications computer networks Ubiquitous computing Base stations Laboratories

来源：评论

学校读者我要写书评

暂无评论

A profile-based protein sequence alignment algorithm for a domain clustering database

A profile-based protein sequence alignment algorithm for a d...

引用

IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology (CIBCB)

作者： Lin Xu Fa Zhang Zhiyong Liu Graduate School of Chinese Academy of Sciences China Key Laboratory of Computer System and architecture Institute of Computing Technology Chinese Academy and Sciences China National Natural Science Foundation China

Aiming at the two main shortcomings in Homology Modeling, we have designed and established a domain clustering database. Searching the database is a fundamental work for it. However, current alignment algorithms are mainly based on the sequences, ignoring the structure conservation in domain. This paper proposed a profile-based alignment which considers the structure information into the profile, based on the character of our domain database. We designed an experiment within the database. The results show that both the quality and sensitivity of our scheme are better than pure Smith-Waterman and sequence-based profile algorithms. We strongly believe that this work can help to improve the protein structure prediction

关键词： Protein sequence Clustering algorithms Databases Sequences Heuristic algorithms Laboratories computer architecture Algorithm design and analysis Computational efficiency Acceleration

来源：评论

学校读者我要写书评

暂无评论

A method to integrate, assess and characterize the protein-protein interactions

A method to integrate, assess and characterize the protein-p...

引用

IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology (CIBCB)

作者： Fa Zhang Lin Xu Jingchun Chen Zhiyong Liu Bo Yuan Key Laboratory of Computer System and architecture the Institute of Computing Technology Chinese Academy and Sciences China Graduate School Chinese Academy and Sciences China Department of Biomedical Informatics Ohio State Uinversity USA National Natural Science Foundation China

Recently, large-scale protein-protein interactions were recovered using the similar two-hybrid system for the model systems. This information allows us to investigate the protein interaction network from a systematic point of view. However, experimentally determined interactions are susceptible to errors. A previous assessment estimated that only ~10% of the interactions can be supported by more than one independent experiment, and about half of the interactions may be false positives. These false positives might unnecessarily link unrelated proteins, resulting in huge apparent interaction clusters, which complicate elucidation for the biological importance of these interactions. Address this problem, we present an approach to integrate, assess and characterize all available protein-protein interactions in model organisms yeast and fly. We first integrate all available protein-protein interaction databases of yeast and fly, and merge all the datasets. We then use machine learning techniques to score the reliability for each interaction, and to rigorously validate the scoring scheme of yeast protein-protein interactions from different aspects. Our results show that this scoring scheme provides a good basis for selecting reliable protein-protein interaction dataset

关键词： Proteins Fungi Databases Electronics packaging Machine learning Genetics Laboratories Biomedical computing computer architecture Biomedical informatics

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Support Vector Machines Classifier for Pedestrian Detection

An Evolutionary Support Vector Machines Classifier for Pedes...

引用

2006 IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： D. Chen X.b. Cao Y.w. Xu H. Qiao Department of Computer Science and Technology University of Science and Technology Hefei China Anhui Province Key Laboratory Software Computing and Communication Hefei China Institute of Automation Chinese Academy and Sciences Beijing China

In a pedestrian detection system, a classifier is usually designed to recognize whether a candidate is a pedestrian. Support vector machines (SVM) has become a primary technique to train a classifier for pedestrian detection. However, it is hard to give the best training model which has a tremendous effect to the performance of a SVM classifier. In this paper, we design special code/decode scheme and evaluation function for a training model firstly; and then use genetic algorithm to optimize key parameters which represent the SVM training model. Therefore a most suitable SVM classifier can be obtained for pedestrian detection. Experiments have been carried out in a single camera based pedestrian detection system. The results show that the evolutionary SVM classifier has a better detection rate; moreover, RBF kernel is more suitable than polynomial kernel when chosen in an evolutionary SVM classifier for pedestrian detection

关键词： Support vector machines Support vector machine classification Kernel Genetic algorithms Decoding Design optimization Cameras Intelligent robots computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

Negotiation-based approach for software process collaboration

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2006年第2期43卷 314-320页

作者： Zhao, Xinpei Li, Mingshu Chan, Keith Wang, Qing Laboratory for Internet Software Technology Institute of Software Chinese Academy of Sciences Beijing 100080 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

Large-scale software development typically requires participation of multiple people. One motivation of the participants to collaborate with others is to maximize the profit they may gain from the software development. Therefore, the collaborative relations between the participants should be established through negotiation in order to ensure that all the participants can gain profit. Traditional software process modeling approaches model software collaboration as a set of rules or transactions. When entry criteria are satisfied or operations are explicitly invoked, the collaborations will take place necessarily and are performed in a predefined manner. Negotiation issues are mostly overlooked by these approaches. A negotiation-based approach for software process collaboration is proposed, In this approach, software process is modeled as a group of independent, autonomous, rational, and collaborative process agents. The collaborative relations between the process agents are established through negotiation. Using this approach, software organizations can carry out software development more efficiently and effectively.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of concept-interconnection

引用

Journal of Computational Information Systems 2005年第4期1卷 863-869页

作者： Lei, Yuxia Sui, Yuefei Cao, Baoxiang Wang, Yan Yu, Jiguo College of Computer Science and Technology Qufu Normal University Rizhao 276826 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

As a suitable tool for analyzing concept interconnection formally, the theory of Formal Concept Analysis (FCA) is applied. FCA deals with formal mathematical tools and techniques to develop and analyze relationship between concepts and to develop concept structures, and concepts are important building blocks in the concept-interconnection. This paper mainly discusses how FCA can be used to support concept-interconnection analysis from an application point of view. In order to introduce our idea, two kinds of concept-interconnection and interconnection measure in detail are discussed. One is based on Concept-Backbone and the other is based on the attributes. It is seen that FCA can support the building of concept-interconnection as a learning technique, but the established concept-interconnection also can be analyzed by using techniques of FCA.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Improving latency tolerance of network processors through simultaneous multithreading

引用

6th International Workshop on Advanced Parallel Processing Technologies, APPT 2005

作者： Liang, Bo An, Hong Lu, Fang Guo, Rui Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Computer Architecture Laboratory Institute of Computing Technology Chinese Academy of Sciences Beijing 100086 China

ISBN: (纸本)3540296395

Existing multithreaded network processors architecture with multiple processing engines (PEs), aims at taking advantage of blocked multithreading technique which executes instructions of different user-defined threads in the same PE pipeline, in explicit and interleave way. Multiple PEs, each of which is a multithreaded processor core, process several packets in parallel to hide long memory access latency. Most of them are optimized for throughputs mostly in data-plane. In future network workloads, the boundaries between data-plane and control-plane become blurred, so that PEs are demanded not only wire speed packet forwarding on data-plane, but also highly intelligent and increased complex packet processing function on control-plane. In this paper, we analyze SMT's short latency tolerance potential when used in out-of-order and dynamic scheduling PE cores. We show in this paper that 2-4 issue SMT provides an excellent short memory and branch latency tolerance, which gain higher instructions throughout as well as much simpler structures. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of allgather algorithms on terascale Linux cluster with Fast Ethernet

Performance evaluation of allgather algorithms on terascale ...

引用

8th International Conference on High-Performance computing in Asia-Pacific Region

作者： Chen, Jing Zhang, Linbo Zhang, Yunquan Yuan, Wei Department of Computer Science University of Science and Technology of China China Lab. of Parallel Computing Institute of Software CAS China State Key Laboratory of Computer Science China Academy of Mathematics and Systems Sciences CAS China

ISBN: (纸本)0769524869

We report our work on evaluating performance of several MPI Allgather algorithms on Fast Ethernet. These algorithms are ring, recursive doubling, Bruck, and neighbor exchange. The first three algorithms are widely used today. The neighbor exchange algorithm which was recently proposed by the authors incorporates pair-wise exchange, and is expected to perform better with certain configurations, mainly when using TCP/IP over Ethernet. We tested the four algorithms on terascale Linux clusters DeepComp 6800 and DAWNING 4000A using TCP/IP over Fast Ethernet. Results show that our neighbor exchange algorithm performs the best for long messages, the ring algorithm performs the best for medium-size messages and the recursive doubling algorithm performs the best for short messages.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：