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

One Sound and Complete <i>R</i>-Calculus with Pseudo-Subtheory Minimal Change Property

Journal of Computer and Communications 2013年第5期1卷 20-25页

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

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. In 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?Δ.

关键词： Belief Revision R-Calculus Soundness and Completeness of a Calculus Pseudo-Subtheory

来源：评论

学校读者我要写书评

暂无评论

The Sound and Complete R-Calculi with Respect to the Set-Based and Inference-Based Minimal Change

The Sound and Complete R-Calculi with Respect to the Set-Bas...

引用

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 Δ .

关键词：

来源：评论

学校读者我要写书评

暂无评论

SALIENT REGION DETECTION VIA TEXTURE-SUPPRESSED BACKGROUND CONTRAST

SALIENT REGION DETECTION VIA TEXTURE-SUPPRESSED BACKGROUND C...

引用

IEEE International Conference on Image processing

作者： Jiamei Shuai Laiyun Qing Jun Miao Zhiguo Ma Xilin Chen University of Chinese Academy of Sciences Beijing 100049 China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing 100190 China

ISBN: (纸本)9781479923427

We propose a novel salient region detection algorithm by texture-suppressed background contrast. We employ a structure extraction algorithm to suppress the small scale textures which are supposed to be not sensitive for human vision system. Then the texture-suppressed image is segmented into homogeneous superpixels. Motivated by the observation that the spatial distribution of the background has a high probability on the boundaries of images, we estimate the background as superpixels near the image boundaries. The saliency of each superpixel is then defined as the summation of its k minimum color distances to the estimated background super-pixels. Finally a post-processing process involving spatial and color adjacency is employed to generate a per-pixel saliency map. Experimental results demonstrate that the proposed method outperforms the state-of-the-art approaches.

关键词： Salient region detection Background contrast Texture suppression Superpixels BACKGROUND images Summation computer vision Boundary value problems Grain boundaries boundary layer Color Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

INSTANCE-SPECIFIC CANONICAL CORRELATION ANALYSIS FOR POSE ALIGNMENT

INSTANCE-SPECIFIC CANONICAL CORRELATION ANALYSIS FOR POSE AL...

引用

IEEE International Conference on Image processing

作者： Deming Zhai Hong Chang Xilin Chen Wen Gao School of Computer Science and Technology Harbin Institute of Technology Harbin China 150001 Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences (CAS) Beijing China 100080

ISBN: (纸本)9781479923427

Canonical correlation analysis (CCA) based methods achieve great success for pose alignment. However, CCA has limitations as a linear and global algorithm. Although some variants have been proposed to overcome the limitations, neither of them achieves locality and nonlinearity at the same time. In this paper, we propose a novel algorithm called Instance-Specific Canonical Correlation Analysis (ISCCA), which approximates the nonlinear data by computing the instance specific projections along the smooth curve of the manifold. Based on the framework of least squares regression, CCA is extended to the instance-specific case which obtains a set of locally-linear smooth but globally-nonlinear transformations. The optimization problem is proved to be convex and could be solved efficiently by alternating optimization. And the globally optimal solutions could be achieved with theoretical guarantee. Experimental results for pose alignment demonstrate the effectiveness of our proposed method.

关键词： proposed alignment transofrmations Alignment Posing optimal solution multivariate analysis nonlinearity Manifolds Convexity

来源：评论

学校读者我要写书评

暂无评论

pNovo+: De Novo Peptide Sequencing and Assembly Using Complementary HCD and ETD Tandem Mass Spectra

pNovo+: De Novo Peptide Sequencing and Assembly Using Comple...

引用

第八届中国蛋白质组学大会

作者： Hao Chi Haifeng Chen Kun He Long Wu Bing Yang Rui-Xiang Sun Jianyun Liu Wen-Feng Zeng Chun-Qing Song Si-Min He Meng-Qiu Dong Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China National Institute of Biological SciencesBeijingBeijing 102206China Laboratory of Intelligent Recognition and Image ProcessingBeijing Key Laboratory of Digital MediaBeihang UniversityBeijing100191China

来源：评论

学校读者我要写书评

暂无评论

Progressive Image Restoration through Hybrid Graph Laplacian Regularization

Progressive Image Restoration through Hybrid Graph Laplacian...

引用

Data Compression Conference (DCC)

作者： Deming Zhai Xianming Liu Debin Zhao Hong Chang Wen Gao School of Computer Science and Technology Harbin Institute of Technology Harbin China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Harbin Institute of Technology Harbin Heilongjiang CN

ISBN: (纸本)9781467360371

In this paper, we propose a unified framework to perform progressive image restoration based on hybrid graph Laplacian regularized regression. We first construct a multi-scale representation of the target image by Laplacian pyramid, then progressively recover the degraded image in the scale space from coarse to fine so that the sharp edges and texture can be eventually recovered. On one hand, within each scale, a graph Laplacian regularization model represented by implicit kernel is learned which simultaneously minimizes the least square error on the measured samples and preserves the geometrical structure of the image data space by exploring non-local self-similarity. In this procedure, the intrinsic manifold structure is considered by using both measured and unmeasured samples. On the other hand, between two scales, the proposed model is extended to the parametric manner through explicit kernel mapping to model the inter-scale correlation, in which the local structure regularity is learned and propagated from coarser to finer scales. Experimental results on benchmark test images demonstrate that the proposed method achieves better performance than state-of-the-art image restoration algorithms.

关键词： Kernel Noise Image restoration Laplace equations Noise measurement Manifolds Linear programming

来源：评论

学校读者我要写书评

暂无评论

Sentimental Space Based Analysis of User Personalized Sentiments

Sentimental Space Based Analysis of User Personalized Sentim...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Xinzhi Wang Xiangfeng Luo School of Computer Engineering and Science Shanghai University Shanghai China Key Laboratory of Intelligent Information Processing Institute of Computing Technology hinese Academy of Sciences Beijing China

With the development of social media, online documents such as the comments of news articles, blogs and microblogs have received great attention, and the sentiment analysis via online documents has become one popular research area. This paper focuses on establishing user sentimental space obtained from online documents to analyze user's personalized sentiments, which aims to identify user's sentimental feature. Affection, sentiment and attributes of user are firstly employed to build user's personalized sentimental space. Then, the general constrains of user sentiments space are proposed to calculate user's personality. And finally we seek out sentimental leaders who paly pivotal role in the leading public opinions. Our works can give some suggestions for decision makers when urgent event happen.

关键词： Feature extraction Vectors Aerospace electronics Controllab.lity Asymptotic stability Stability analysis Fluctuations

来源：评论

学校读者我要写书评

暂无评论

Genome-wide identification of cancer-related polyadenylated and non-polyadenylated RNAs in human breast and lung cell lines

引用

Science China(Life Sciences) 2013年第5期56卷 503-512,1-4页

作者： ZHAO GuoGuang JIAO Fei LIAO Qi LUO HaiTao LI Hui SUN Liang BU DeChao YU KunTao ZHAO Yi CHEN RunSheng Bioinformatic Research Group Key Laboratory of Intelligent Information ProcessingAdvanced Computing Research LaboratoryInstitute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences Department of Biochemistry and Molecular Biology Binzhou Medical College Department of Preventive Medicine School of MedicineNingbo University College of Computer Science and Technology Jilin University Bioinformatics Laboratory and National Laboratory of Biomacromolecules Institute of BiophysicsChinese Academy of SciencesBeijing 100101China

Eukaryotic mRNAs consist of two forms of transcripts:poly(A)+ and poly(A),based on the presence or absence of poly(A) tails at the 3 ***(A)+ mRNAs are mainly protein coding mRNAs,whereas the functions of poly(A) mRNA are largely *** studies have shown that a significant proportion of gene transcripts are poly(A) or bimorphic(containing both poly(A)+ and poly(A) transcripts).We compared the expression levels of poly(A) and poly(A)+ RNA mRNAs in normal and cancer cell *** also investigated the potential functions of these RNA transcripts using an integrative workflow to explore poly(A)+ and poly(A) transcriptome sequences between a normal human mammary gland cell line(HMEC) and a breast cancer cell line(MCF-7),as well as between a normal human lung cell line(NHLF) and a lung cancer cell line(A549).The data showed that normal and cancer cell lines differentially express these two forms of *** ontology(GO) annotation analyses hinted at the functions of these two groups of transcripts and grouped the differentially expressed genes according to the form of their *** data showed that cell cycle-,apoptosis-,and cell death-related functions corresponded to most of the differentially expressed genes in these two forms of transcripts,which were also associated with the ***,translational elongation and translation functions were also found for the poly(A) protein-coding genes in cancer cell *** demonstrate that poly(A) transcripts play an important role in cancer development.

关键词： polyadenylation non-polyadenylation function annotation high throughput sequencing cancer bioinformatics

来源：评论

学校读者我要写书评

暂无评论

A Model of Three Points for Location Estimation in Wireless Sensor Networks

A Model of Three Points for Location Estimation in Wireless ...

引用

2013 2nd International Symposium on Materials Science and Engineering technology(ISMSET 2013)

作者： Shaoguo Xie Yanjun Hu Yi Wang Fang Jiang Jingjing Liu Yingguan Wang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education An Hui University Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences

In this paper, we propose a novel model of three points named TP for location estimation in wireless sensor networks(WSNs) with random deployment of anchor nodes. In this model, we select three anchor nodes which have the strongest received signal strength(RSS) for location estimation, the centroid algorithm and the method of intersection of judgment are used to estimate the location of unknown nodes. To further exploit three nearest intersection points in TP, the enhanced TP(ETP) is proposed. The simulation results show that the proposed models outperform MMSE and BML in terms of the localization accuracy for WSNs. Moreover, the localization accuracy of the proposed models in scenario 2 with random deployment of anchor nodes are better than in scenario 1 with planned deployment of anchor nodes. Additionally, compared with MMSE and BML, ETP and TP can reduce the environmental impact on location estimation.

关键词： Location estimation Anchor node Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：