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

2010 IEEE 5th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2010

作者： Zhang, Zhujin Wang, Shuo Zhang, Xingyi Zhang, Zheng Department of Control Science and Engineering Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China School of Computer and Information Science University of South Australia Adelaide SA 5095 Australia Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781424464388

Randí et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n2), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species. © 2010 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Class compactness for data clustering

Class compactness for data clustering

引用

IEEE International Conference on information Reuse and Integration (IRI)

作者： Yuqing Song Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences China

In this paper we introduce a compactness based clustering algorithm. The compactness of a data class is measured by comparing the inter-subset and intra-subset distances. The class compactness of a subset is defined as the ratio of the two distances. A subset is called an isolated cluster (or icluster) if its class compactness is greater than 1. All iclusters make a containment tree. We introduce monotonic sequences of iclusters to simplify the structure of the icluster tree, based on which a clustering algorithm is designed. The algorithm has the following advantages: it is effective on data sets with clusters nonlinearly separated, of arbitrary shapes, or of different densities. The effectiveness of the algorithm is demonstrated by experiments.

关键词： Clustering algorithms Kernel Partitioning algorithms Algorithm design and analysis Shape Pediatrics Joining processes

来源：评论

学校读者我要写书评

暂无评论

A level set based method of license plate localization

A level set based method of license plate localization

引用

IEEE International Conference on information Reuse and Integration (IRI)

作者： Yuqing Song Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences China

This paper presents a robust and real time method of license plate localization based on level sets. The proposed algorithm consists of three steps: (1) medial axis transformation of selected level sets, (2) identification of sub-strokes, and (3) a multi-resolution window-based analysis for plate localization. Experiments show the effectiveness of our algorithm.

关键词： Level set Licenses Algorithm design and analysis Accuracy Skeleton Image segmentation Pixel

来源：评论

学校读者我要写书评

暂无评论

Visual information retrieval from 2D shapes by bipolar-matching

Visual information retrieval from 2D shapes by bipolar-match...

引用

IEEE International Conference on information Reuse and Integration (IRI)

作者： Yuqing Song Institute of Computing Technology Key Laboratory of Intelligent Information Processing Chinese Academy and Sciences China

One of the most challenging issues in visual information retrieval is retrieval by shape, due to a lack of mathematically rigorous definition of shape similarity. This paper presents a bipolar model for computing shape similarity. Given a discrete region, we cut its Voronoi diagram into two parts along the border of the region and each part is a tree. We use the two trees to respectively model the structures of a region and its complement, which is called the Bipolar Model. We prune the two trees by removing the nodes with small protrusions. The leaf nodes of the pruned trees are interleaved to make a leaf chain. Two regions are compared and matched, using a cyclic edit distance between the two leaf chains, with restricted merge and split operations allowed. We tested our algorithm on the MPEG-7 data set and made a “bullseye” score of 89.9%, which is the best performance ever reported.

关键词： Shape Electric shock Transform coding Computational modeling Nearest neighbor searches Classification algorithms Visualization

来源：评论

学校读者我要写书评

暂无评论

Object tracking by chiaroscuro patterns

Object tracking by chiaroscuro patterns

引用

IEEE International Conference on information Reuse and Integration (IRI)

作者： Yuqing Song Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences China

Chiaroscuro in art is characterized by strong contrasts between light and dark. An object in a certain light condition has a certain chiaroscuro pattern in appearance; and this pattern is invariant to the changes of illumination and pose within a certain extent. In this paper we introduce an object tracking method based on chiaroscuro patterns. The chiaroscuro pattern of an image is computed by running a medial axis transform on selected level sets. The medial axes are pruned and decomposed into segments. These segments make a chiaroscuro pattern. The end points of the segments are collected as key points, which are fed to Kalman filter for object tracking. The effectiveness of the algorithm is demonstrated by experiments.

关键词： Image segmentation Skeleton Kalman filters Level set Target tracking Transforms

来源：评论

学校读者我要写书评

暂无评论

Translating Separation Logic into a Fragment of the First-Order Logic

Translating Separation Logic into a Fragment of the First-Or...

引用

Sixth International Conference on Semantics,Knowledge and Grids(第六届语义、知识与网格国际会议 SKG 2010)

作者： Cungen Cao Yuefei Sui Yuming Shen Ju Wang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Aca Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Aca School of Computer Science and Information Engineering Guangxi Normal University Guilin China 54100

Separation logic is an extension of Hoare logic for reasoning about mutable heap structure. To represent separation logic in the first-order logic, there are several choices to determine what are constants, what are predicates and quantifiers, and whether the commands are taken as atomic or composite. This paper shall give a translation of separation logic into a guarded fragment of the first-order logic, such that the translation is faithful, that is, the translation translates a consistent statement (boolean expression, assertion or specification) of separation logic into a consistent formula in the fragment of the first-order logic. By the decidability of the satisfiability problem of the guarded first-order logic, if the commands are taken as atomic in the first-order logic then the guarded first-order logic translated from separation logic is decidable;if the commands are taken as atomic/composite in the first-order logic then the first-order logic translated from separation logic is undecidable.

关键词： Semantics Syntactics Computers Cognition Object oriented modeling information processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Extend atomic action definitions of DDL to support occlusions and conditional post-conditions

引用

作者： Chang, Liang Shi, Zhongzhi Gu, Tianlong School of Computer and Control Guilin University of Electronic Technology Guilin 541004 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)3642163262

The dynamic description logic DDL provides a kind of action theories based on description logics (DLs). Compared with another important DL-based action formalism constructed by Baader ***., a shortcoming of DDL is the absence of occlusions and conditional post-conditions in the description of atomic actions. In this paper, we extend atomic action definitions of DDL to overcome this limitation. Firstly, we introduce extended atomic action definitions in which the occlusions and conditional post-conditions are incorporated. Secondly, for each atomic action specified by an extended atomic action definition, a function named Expand is introduced to transform it into a choice action which is composed of atomic actions defined by ordinary atomic action definitions. Finally, based on the Expand function, the satisfiability-checking algorithm of DDL is extended to support occlusions and conditional post-conditions. © 2010 IFIP.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

A domain-specific question answering system based on ontology and question templates

A domain-specific question answering system based on ontolog...

引用

11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed computing, SNPD2010

作者： Wang, D.S. Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Graduate University of the Chinese Academy of Sciences Beijing China Department of Computer Science Jiangsu University of Science and Technology Zhenjiang China

ISBN: (纸本)9780769540887

The rapid growth in the development of Internet-based information systems increases the demand for natural language interfaces that are easy to set up and maintain. Unfortunately, the problem of deep understanding natural language queries is far from being solved. In this paper, an automated question answering system based on domain ontology and question template is proposed, which does not need deep understanding of user's questions. Ontology was employed to model the interesting domain, and properties of concepts are described by a collection of question templates. The system captures a user's intention by matching his questions to predefined templates, and return answers corresponding to template's query focus. The system has been applied to mobile service consulting area, and experimental results show that the system has high practicability as well as maintainability. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Runtime analysis of satisfactory solutions of particle swarm optimization

引用

Journal of Computational information Systems 2010年第13期6卷 4590-4600页

作者： Feng, Jiqiang Xie, Weixin Xu, Chen Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen 518060 China Institute of Intelligent Computing Science Shenzhen University Shenzhen 518060 China

This paper proposes two models for the runtime analysis of satisfactory solutions of particle swarm optimization problems. Satisfactory solutions are important from a practical point of view because the precise optimum solutions of many optimization problems are difficult to obtain. The first model, called the satisfactory solutions model, employs fuzzy stochastic variables to denote fitness function of PSO and the second one, called the runtime analysis model, uses a counting process to reveal the runtime of different satisfactory solutions. The main idea of the latter model is to transform the runtime problem into a number counting problem with observable statistical results. More precisely, the interval time sequence between successive iterations is exponentially distributed with probability 1 and the satisfactory solutions runtime sequence is a Γ distribution with probability 1. © 2010 Binary information Press.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Exploiting associations between word clusters and document classes for cross-domain text categorization

Exploiting associations between word clusters and document c...

引用

10th SIAM International Conference on Data Mining, SDM 2010

作者： Zhuang, Fuzhen Luo, Ping Xiong, Hui He, Qing Xiong, Yuhong Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Hewlett Packard Labs China MSIS Department Rutgers University United States Graduate University of Chinese Academy of Sciences China

Cross-domain text categorization targets on adapting the knowledge learnt from a labeled source-domain to an unla-beled target-domain, where the documents from the source and target domains are drawn from different distributions. However, in spite of the different distributions in raw word features, the associations between word clusters (conceptual features) and document classes may remain stable across different domains. In this paper, we exploit these unchanged associations as the bridge of knowledge transformation from the source domain to the target domain by the nonnegative matrix tri-factorization. Specifically, we formulate a joint optimization framework of the two matrix tri-factorizations for the source and target domain data respectively, in which the associations between word clusters and document classes are shared between them. Then, we give an iterative algorithm for this optimization and theoretically show its convergence. The comprehensive experiments show the effectiveness of this method. In particular, we show that the proposed method can deal with some difficult scenarios where baseline methods usually do not perform well. Copyright © by SIAM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：