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

2013 Asia-Pacific Computational Intelligence and information technology Conference(APCIIT 2013)

作者： LI WEI YUEFEI SUI State Key Laboratory of Software Development Environment Beijing University of Aeronautics and Astronautics Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences

The AGM axiom system is for the belief revision(revision by a single belief), and the DP axiom system is for the iterated revision(revision by a finite sequence of beliefs). Li[1] gave an R-calculus for R-configurations |Γ, where is a set of atomic formulas or the negations of atomic formulas, and Γ is a finite set of formulas. The set-based minimal change and inference-based minimal change are distinguished in this paper, and two R- calculi V and N are given so that V and N are sound and complete with respect to the set-based minimal change and the inference-based minimal change, respectively.

关键词： Belief Revision,R-Calculus,Minimal Change,Contraction,Soundness and Completeness.

来源：评论

学校读者我要写书评

暂无评论

One Sound and Complete R-Calculus with Pseudo-Subtheory Minimal Change Property

One Sound and Complete R-Calculus with Pseudo-Subtheory Mini...

引用

2013 Conference on Artificial Intelligence and Data Mining(AIDM 2013);2013 Business Economics and Investment Conference(BEI 2013);2013 Water Pollution and Treatment Conference(WPT 2013)

作者： Wei Li Yuefei Sui State Key Laboratory of Software Development Environment Beijing University of Aeronautics and Astronautics Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences

The AGM axiom system is for the belief revision (revision by a single belief),and the DP axiom system is for the iterated revision (revision by a finite sequence of beliefs).Li [1] gave an R-calculus for R-configurations Δ| Γ,where Δ is a set of atomic formulas or the negations of atomic formulas,and Γ is a finite set of *** propositional logic programs,one R-calculus N will be given in this paper,such that N is sound and complete with respect to operator s (Δ,t),where s (Δ,t)is a pseudo-theory minimal change of t by Δ .

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel neural network classification model based on covering and Affinity Propagation clustering algorithm

引用

Journal of Computational information Systems 2013年第7期9卷 2565-2573页

作者： Li, Hui Ding, Shifei School of Computer Science and Technology China University of Mining and Technology Xuzhou 221116 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Jiangsu Normal University Xuzhou 221116 China

Affinity Propagation (AP) algorithm can automatically determine the cluster center and does not need a pre-determined number of clustering. This paper presents a novel neural network classification model, using AP clustering method as a pre-processor to cluster high dimensional massive data samples, and combining covering algorithm to automatically determine the center of the covering, and calculating its radius, and then converting these parameters into the weights and thresholds of the hidden layer of classification neural network. The number of hidden layer neurons is the number of covering. The output layer is the M-P neuron layer. By evaluating the input feature of hidden layer to complete the mapping from covering to the output, and gain the corresponding output category of the input feature. Simulation results show that our proposed neural network classification model can get better performance. Copyright © 2013 Binary information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Bilingually-guided monolingual dependency grammar induction

Bilingually-guided monolingual dependency grammar induction

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Liu, Kai Lü, Yajuan Jiang, Wenbin Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Centre for Next Generation Localisation Faculty of Engineering and Computing Dublin City University Ireland University of Chinese Academy of Sciences China

ISBN: (纸本)9781937284503

This paper describes a novel strategy for automatic induction of a monolingual dependency grammar under the guidance of bilingually-projected dependency. By moderately leveraging the dependency information projected from the parsed counterpart language, and simultaneously mining the underlying syntactic structure of the language considered, it effectively integrates the advantages of bilingual projection and unsupervised induction, so as to induce a monolingual grammar much better than previous models only using bilingual projection or unsupervised induction. We induced dependency grammar for five different languages under the guidance of dependency information projected from the parsed English translation, experiments show that the bilinguallyguided method achieves a significant improvement of 28.5% over the unsupervised baseline and 3.0% over the best projection baseline on average. © 2013 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Prediction of hot regions in protein-protein interactions based on complex network and community detection

Prediction of hot regions in protein-protein interactions ba...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Dongfang Nan Xiaolong Zhang Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)9781479913114

In the protein-protein interactions (PPI), hot regions are the key factor to maintain metabolism and the cause of disease. The conformation and prediction of the hot regions effectively is a worth researching topics. This paper proposes a prediction method of hot regions based on complex network and community detection. In the prediction process, a hotspots retrieving strategy is used to exploit false positive (FP) and false negative (FN) residues, and these FP and FN residues achieved from the previous hotspots prediction. The method has advantage to identify hot regions in PPI, and experimental results show that the method not only improves the prediction accuracy of hot regions, but also has more reliability.

关键词： Communities Proteins Complex networks Accuracy Prediction algorithms Testing Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Modeling lexical cohesion for document-level machine translation

Modeling lexical cohesion for document-level machine transla...

引用

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Xiong, Deyi Ben, Guosheng Zhang, Min Lü, Yajuan Liu, Qun School of Computer Science and Technology Soochow University Suzhou 215006 China Institute for Infocomm Research 1 Fusionopolis Way 21-01 Connexis 138632 Singapore Key Laboratory of Intelligent Information Processing Institute of Computing Technology China Centre for Next Generation Localisation School of Computing Dublin City University Ireland

ISBN: (纸本)9781577356332

Lexical cohesion arises from a chain of lexical items that establish links between sentences in a text. In this paper we propose three different models to capture lexical cohesion for document-level machine translation: (a) a direct reward model where translation hypotheses are rewarded whenever lexical cohesion devices occur in them, (b) a conditional probability model where the appropriateness of using lexical cohesion devices is measured, and (c) a mutual information trigger model where a lexical cohesion relation is considered as a trigger pair and the strength of the association between the trigger and the triggered item is estimated by mutual information. We integrate the three models into hierarchical phrase-based machine translation and evaluate their effectiveness on the NIST Chinese-English translation tasks with large-scale training data. Experiment results show that all three models can achieve substantial improvements over the baseline and that the mutual information trigger model performs better than the others.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Adaptive visual servoing using common image features with unknown geometric parameters

Adaptive visual servoing using common image features with un...

引用

作者： Liu, Yun-Hui Wang, Hesheng Chen, Weidong Zhou, Dongxiang Department of Mechanical and Automation Engineering Chinese University of Hong Kong Hong Kong Hong Kong Department of Automation Shanghai Jiao Tong University China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China State Key Laboratory of Robotics Technology and System Harbin Institute of Technology Harbin 150001 China Joint Center for Intelligent Sensing and Systems National University of Defense Technology China

This paper generalizes the concept of the depth-independent interaction matrix, developed for point and line features in our early work, to generalized image features. We derive the conditions under which the depth-independent interaction matrix can be linearly parameterized by the geometric parameters of the generalized image features, and propose an adaptive visual servo controller for robot manipulators using the generalized image features whose geometric parameters are unknown. To estimate the unknown parameters on-line, we propose new error functions that are linear to estimation errors of the parameters and an algorithm that minimizes the error functions using multiple images. The Lyapunov theory is used to prove asymptotic stability of the proposed controller based on the nonlinear dynamics of the manipulator. It is also shown that in addition to points and lines, other common image features like distances, angles, areas, and centroids all satisfy the conditions for the linear parameterization. Experiments have been conducted to validate the proposed control method. © 2013 Elsevier Ltd. All rights reserved.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Pattern Matching with Wildcard Gaps Based on Cross List

Pattern Matching with Wildcard Gaps Based on Cross List

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： Junyan Zhang Chenhui Yang Information Science and Technology College Chengdu University Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan Chengdu University Chengdu China

Pattern matching is a fundamental application text retrieval, string query, biological sequence analysis, etc. Therefore, the effective algorithm performing this kind of matching is in great need. In this paper, the wildcard is defines to match any one character in a sequence. Multiple wildcards form a gap. The length of a flexible gap is arbitrary. We design CLPM algorithm by use of cross list index structure to realize pattern matching with flexible wildcard gaps. The preprocessing algorithm is designed to initialize cross list so as to reduce searching space. In CLPM algorithm, the effective intervals is defined and computed based on the start positions of each sub pattern in each string, which help to obtain matching result set. Moreover, the approximate pattern matching is converted to short extract pattern matching. The contrast experiments are done based on DBLP tile data set. The results show that CLMP algorithm has better performance in the same fields.

关键词： Pattern matching Indexes Silicon Algorithm design and analysis Approximation algorithms Presses Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Compressed sensing based on best wavelet packet basis for image processing

引用

Journal of Computers (Finland) 2013年第8期8卷 1947-1950页

作者： Li, Zhe Tao Xie, Jing Xiong Yu, Zu Guo Tu, Deng Biao Choi, Young June The College of Information Engineering Xiangtan University Hunan 411105 China School of Computer National University of Defense Technology Hunan 410073 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 China School of Mathematics and Computational Science Xiangtan University Hunan 411105 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China Department of Information and Computer Engineering Ajou University Suwon 443749 Korea Republic of

In this paper, an algorithm named best wavelet packet tree decomposition (BWPTD) is proposed for image compression. In order to obtain better sparse representation of image, best wavelet packet basis is introduced to decompose image signal in the algorithm. Experimental results show that BWPTD is better than single layer wavelet decompression (SLWD) and original compressed sensing (OCS) in peak signal to noise ratio (PSNR) by 2db and 8db, respectively. In addition, the reconstruction time of BWPTD is only half as that of SLWD and OCS. © 2013 ACADEMY PUBLISHER.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Object based dual watermarking for video authentication

引用

Optik 2013年第19期124卷 3827-3834页

作者： Yanjiao Shi Miao Qi Yugen Yi Ming Zhang Jun Kong School of Computer Science and Information Technology Northeast Normal University Key Laboratory of Intelligent Information Processing of Jilin Universities Changchun 130117 China School of Mathematics and Statistics Northeast Normal University Changchun 130117 China

Video cameras have been widely installed in public facilities for the surveillance applications. So, video authentication has becoming increasingly attractive. This paper presents a dual watermarking for video authentication based on moving objects. For each frame, the frame index, as a watermark is first embedded into the moving objects of the corresponding frame using a reversible watermarking method, aiming to detect the temporal tampering. Then the principle content and the details of the moving objects combined with the authentication code, as the other watermark, are embedded into the frame for spatial tampering location and recovery. Specially, a synthesized frame method is proposed for lossless recovery of moving objects and effective extraction of frame index. Statistical analysis and experiment results show that the proposed method can locate spatial, temporal and spatio-temporal tampering accurately. The spatial tampered regions can be recovered approximately and the moving objects can be restored completely when the tampered area is limited.

关键词： Video authentication Self-embedding Video tampering Synthesized frame

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：