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

2011 8th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Zhao, Weizhong Ma, Huifang He, Qing Shi, Zhongzhi College of Information Engineering Xiangtan University Hunan 411105 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China College of Mathematics and Information Northwest Normal University Gansu China

ISBN: (纸本)9781612841816

Non-negative Matrix Factorization (NMF) is one latest presented approach for obtaining document clusters, which aimed to provide a minimum error non-negative representation of the term-document matrix. In this paper, we have extended the classical NMF approach by imposing sparseness constraints explicitly. The new model can learn much sparser matrix factorization. Also, an objective function is defined to impose the sparseness constraint, in addition to the non-negative constraint. Experimental results on real-world document datasets show that the proposed method can treat document clustering effectively and efficiently. © 2011 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

A scalable parallel ray tracing algorithm for satellite imagery

A scalable parallel ray tracing algorithm for satellite imag...

引用

IEEE International Conference on Computer Research and Development

作者： Li, Yu-Gang Zhao, Kun Huang, Yu-Qing Qiu, Zhen-Ge Liu, Zhi-Yong Beijing Lab. of Intelligent Information Technology School of Computer Science BIT Beijing 100081 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100081 China Institute of Computing Technology Chinese Academy Sciences Beijing China

ISBN: (纸本)9781612848372

Ray-tracing, can produce high-quality images, however, the use of ray-tracing has been limited due to its high demands on computational power and memory bandwidth, especially in the case of satellite imagery. In this paper, we propose a scalable parallel ray tracing algorithm of satellite imagery on a cluster of multi-core architecture. The algorithm combines demand-driven and data-driven models in order to reduce communication on the cost of maintaining redundant data. In order to make the most of computer's parallelism and increase computational efficiency, it combines two levels of parallelisms, the TLP parallelism brought by the many core architecture and the inter-node parallelism via MPI and OpenMP. Experiment results show that the algorithm is highly scalability. © 2011 IEEE.

关键词： Satellite imagery

来源：评论

学校读者我要写书评

暂无评论

Combining supervised and unsupervised models via unconstrained probabilistic embedding

Combining supervised and unsupervised models via unconstrain...

引用

22nd International Joint Conference on Artificial Intelligence, IJCAI 2011

作者： Ma, Xudong Luo, Ping Zhuang, Fuzhen He, Qing Shi, Zhongzhi Shen, Zhiyong Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Hewlett Packard Labs. China China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9781577355120

Ensemble learning with output from multiple supervised and unsupervised models aims to improve the classification accuracy of supervised model ensemble by jointly considering the grouping results from unsupervised models. In this paper we cast this ensemble task as an unconstrained probabilistic embedding problem. Specifically, we assume both objects and classes/clusters have latent coordinates without constraints in a D-dimensional Euclidean space, and consider the mapping from the embedded space into the space of results from supervised and unsupervised models as a probabilistic generative process. The prediction of an object is then determined by the distances between the object and the classes in the embedded space. A solution of this embedding can be obtained using the quasi-Newton method, resulting in the objects and classes/clusters with high co-occurrence weights being embedded close. We demonstrate the benefits of this unconstrained embedding method by three real applications.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Dynamic description logics based semantic web services composition

Dynamic description logics based semantic web services compo...

引用

3rd International Conference on Artificial Intelligence and Computational Intelligence, AICI 2011

作者： Peng, Hui Chen, Limin Zeng, Weizhong Tang, Junjian Education Technology Center Beijing International Studies University Beijing 100024 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Information Engineering School Nanchang University Nanchang 330031 China

ISBN: (纸本)9783642238864

The automatic Web services composition has been a research focus since an ever-increasing numbers of Web services are created and published. In this paper, we present a dynamic description logics (DDLs) based method for automatic Web services composition. DDLs are an extension of description logic with a dynamic dimension. It adds actions expressions into description logic and makes up a set of reasoning mechanism for action expressions. The DDLs reasoner has been built for DDLs formulas. As an Web service can be regarded as an action in Web, its accomplishment changes the state of Web, from original state to aim state, an Web service can be described as an action in DDLs, which this action can be described in terms of formulas in DDLs. Due to these relations between Web service and DDLs actions, our method describes both the goal service and atomic services in terms of DDLs formulas. We proved that if a goal formula can not be satisfied then the services composition can be found. The procedure of checking the satisfiability of the formula is also the procedure of discovering the services composition. Thus the problem of automatic services composition is reduced to the problem of checking the satisfiability of formulas in DDLs. An example of automatic services composition in travel area shows the effectiveness of our method. © 2011 Springer-Verlag.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

No-go theorem for one-way quantum computing on naturally occurring two-level systems

引用

Physical Review A 2011年第5期83卷 050301(R)-050301(R)页

作者： Jianxin Chen Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales Australia Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

The ground states of some many-body quantum systems can serve as resource states for the one-way quantum computing model, achieving the full power of quantum computation. Such resource states are found, for example, in spin-52 and spin-32 systems. It is, of course, desirable to have a natural resource state in a spin-12, that is, qubit system. Here, we give a negative answer to this question for frustration-free systems with two-body interactions. In fact, it is shown to be impossible for any genuinely entangled qubit state to be a nondegenerate ground state of any two-body frustration-free Hamiltonian. What is more, we also prove that every spin-12 frustration-free Hamiltonian with two-body interaction always has a ground state that is a product of single- or two-qubit states. In other words, there cannot be any interesting entanglement features in the ground state of such a qubit Hamiltonian.

关键词： QUANTUM computers QUANTUM theory HAMILTONIAN operator HAMILTONIAN systems PHYSICS

来源：评论

学校读者我要写书评

暂无评论

Attention driven face recognition: A combination of spatial variant fixations and glance

Attention driven face recognition: A combination of spatial ...

引用

IEEE International Conference on Automatic Face and Gesture Recognition

作者： Wang, Chongxiu Qing, Laiyun Miao, Jun Fang, Fang Chen, Xilin School of Information Science and Engineering Graduate University of Chinese Academy of Sciences Beijing 100049 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China

ISBN: (纸本)9781424491407

This paper proposes a novel face recognition algorithm inspired by the selective attention of Human Visual System (HVS). We record four observers' eye movements when they are viewing 100 FRGC [1] frontal view face images and find that the observers are highly consistent in the regions fixated. Inspired by the fact that fovea of HVS has a much higher spatial acuity than the periphery, a face recognition algorithm based on spatial variant sampling is proposed to simulate such foveated imaging phenomenon, where more information is reserved for the fixated regions. Moreover, information extracted from glance which adopts the low spatial frequency components of the image is integrated into the face recognition system to elicit a percept that occurs before any fixations. The experimental results on FERET database [2] demonstrate that the proposed method not only reduces the computational cost, but also achieves comparable performance, which shows that the characteristics of the HVS provide valuable insights into face recognition. © 2011 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Roughness in vector spaces

Roughness in vector spaces

引用

2011 IEEE International Conference on Granular computing, GrC 2011

作者： Wu, Mingfen Xie, Xiangyun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science Wuyi University Guangdong China School of Mathematics and Computational Science Wuyi University China

ISBN: (纸本)9781457703713

Rough set theory proposed by Pawlak, is a complementary generalization of classical set theory. The relations between rough sets and algebraic systems endowed with two binary operations such as rings, groups and semigroups have been already considered. Wu, Xie and Cao defined a pair of rough approximation operators based on a sub-space. In this paper we do the further study about the upper (lower)approximations. We propose concepts of W-upper(lower) rough subspaces in an approximation space and give some properties of the upper(lower) and rough subspaces. Some characterizations of the upper(lower) rough subspace are expressed with addition and intersection operations of subspaces. At the same time, some counterexamples are offered to illustrate the relevant results. © 2011 IEEE.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

An intelligent load balancing algorithm towards efficient cloud computing

An intelligent load balancing algorithm towards efficient cl...

引用

2011 AAAI Workshop

作者： Xu, Yang Wu, Lei Guo, Liying Chen, Zheng Yang, Lai Shi, Zhongzhi Agent-based Cooperative System Lab School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu SC 611731 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781577355243

MapReduce provided a novel computing model for complex job decomposition and sub-tasks management to support cloud computing with large distributed data sets. However, its performance is significantly influenced by the working data distributions over those data sets. In this paper, we put forward a novel model to balance data distribution to improve cloud computing performance in data-intensive applications, such as distributed data mining. By extending the classic MapReduce model with an agent-aid layer and abstracting working load requests for data blocks as tokens, the agents can reason from previously received tokens about where to send other tokens in order to balance the working tasks and improve system performance. Our key contribution lies in building an efficient token routing algorithm in spite of agents' unknowing to the global state of data distribution in cloud. We also built a prototype of our system, and the experimental results show that our approach can significantly improve the efficiency of cloud computing. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Visual saliency detection by spatially weighted dissimilarity

Visual saliency detection by spatially weighted dissimilarit...

引用

作者： Duan, Lijuan Wu, Chunpeng Miao, Jun Qing, Laiyun Fu, Yu College of Computer Science and Technology Beijing University of Technology Beijing 100124 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Information Science and Engineering Graduate University Chinese Academy of Sciences Beijing 100049 China Department of Computing University of Surrey Guildford Surrey GU2 7XH United Kingdom

ISBN: (纸本)9781457703942

In this paper, a new visual saliency detection method is proposed based on the spatially weighted dissimilarity. We measured the saliency by integrating three elements as follows: the dissimilarities between image patches, which were evaluated in the reduced dimensional space, the spatial distance between image patches and the central bias. The dissimilarities were inversely weighted based on the corresponding spatial distance. A weighting mechanism, indicating a bias for human fixations to the center of the image, was employed. The principal component analysis (PCA) was the dimension reducing method used in our system. We extracted the principal components (PCs) by sampling the patches from the current image. Our method was compared with four saliency detection approaches using three image datasets. Experimental results show that our method outperforms current state-of-the-art methods on predicting human fixations. © 2011 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Dual form back propagation on the EM algorithm

Dual form back propagation on the EM algorithm

引用

IEEE International Conference on Granular computing (GRC)

作者： Hong Hu Zhongzhi Shi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Vladimir N. Vapnik. (1998) pointed out that maxlikelihood functions in EM algorithms are just a special risk function. Based on this opinion, a novel EM algorithm uses a risk function differ with maxlikelihood functions, in stead, a risk formula based on the least square method is used. The gradient descending approach should be used in such kind approaches. Such kind EM algorithms can estimate the parameters of a random model from both labeled and unlabeled samples, and are suitable for semi-supervised learning.

关键词： Gaussian distribution Error analysis Maximum likelihood estimation Least squares methods information processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：