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

14th Workshop on Chinese Lexical Semantics, CLSW 2013

作者： Wang, Xing Xie, Jun Song, Linfeng Lv, Yajuan Yao, Jianmin School of Computer Science AndTechnology Soochow University Suzhou China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783642451843

When hierarchical phrase-based statistical machine translation systems are used for language translation, sometimes the translations' content words were lost: source-side content words is empty when translated into target texts during decoding. Although the translations' BLEU score is very high, it is difficult to understand the translations because of the loss of the content words. In this paper, we propose a basic and efficient method for phrase filtering, with which the phrase' content words translation are checked to decide whether to use the phrase in decoding or not. The experimental results show that the proposed method alleviates the problem of the loss content words' and improves the BLEU scores. © 2013 Springer-Verlag.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Color image segmentation based on dynamic model and power spectrum

Color image segmentation based on dynamic model and power sp...

引用

International Conference on Materials Science and Manufacturing, ICMSM 2012

作者： Chen, Yupu Qiao, Yuanhua Miao, Jun College of Applied Sciences Beijing University of Technology Beijing 100124 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783037855614

In this paper, the locally coupled neural oscillator model and power spectrum are introduced to solve the color image segmentation problem. Firstly the single neuron oscillator model is developed, the model parameter is set so as to create limit circle simulating the activity of neuron. Then the locally coupled network model is developed, taking R, G, Bas external input separately, the network output three dynamic orbits representing R, G, B for each image point. Lastly, the power spectrum of the orbits is calculated for each image point, the color image is segmented using the calculated power spectrum. The performance is comparable to the results from other segmentation methods. © (2013) Trans Tech Publications, Switzerland.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Wavelet denoising of SAR images corrupted by speckle noise using cycle spinning

Wavelet denoising of SAR images corrupted by speckle noise u...

引用

2nd International Conference on intelligent Materials, Applied Mechanics and Design Science, IMAMD 2013

作者： Ji, Ming Wei Liu, Yan Li Zhang, De Xiang The Institute of Mechanical and Electrical Engineering of Anhui University of Architecture Hefei 230601 China Key Lab. of Intelligent Computing and Signal Processing Anhui University Hefei 230039 China

ISBN: (纸本)9783037857175

A novel and efficient speckle noise reduction algorithm based on wavelet transform by cycle spinning for removing speckle of unknown variance and minimizing the effect of pseudo-Gibbs phenomena from Synthetic Aperture Radar (SAR) images is proposed. Therefore, we show that the sub-band decompositions of logarithmically transformed SAR images. Then, we process and reconstruct multi-resolution wavelet coefficients by wavelet-threshold using cycle spinning, a technique estimating the true images as the linear average of individual estimates derived from wavelet thresholded translated versions of the noise images. Experimental results show that the proposed de-noising algorithm is possible to achieve an excellent balance between suppresses speckle effectively and weaken as many image Gibbs phenomena as possible. Quantitative and qualitative comparisons of the results obtained by the new method with the results achieved from the other speckle noise reduction techniques demonstrate its higher performance for speckle reduction in SAR images. © (2013) Trans Tech Publications, Switzerland.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Refining image annotation by integrating PLSA with random walk model

Refining image annotation by integrating PLSA with random wa...

引用

19th International Conference on Advances in Multimedia Modeling, MMM 2013

作者： Tian, Dongping Zhao, Xiaofei Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of the Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9783642357244

In this paper, we present a new method for refining image annotation by integrating probabilistic latent semantic analysis (PLSA) with random walk (RW) model. First, we construct a PLSA model with asymmetric modalities to estimate the posterior probabilities of each annotating keywords for an image, and then a lab.l similarity graph is constructed by a weighted linear combination of lab.l similarity and visual similarity. Followed by a random walk process over the lab.l graph is employed to further mine the correlation of the keywords so as to capture the refining annotation, which plays a crucial role in semantic based image retrieval. The novelty of our method mainly lies in two aspects: exploiting PLSA to accomplish the initial semantic annotation task and implementing random walk process over the constructed lab.l similarity graph to refine the candidate annotations generated by the PLSA. Compared with several state-of-the-art approaches on Corel5k and Mirflickr25k datasets, the experimental results show that our approach performs more efficiently and accurately. © Springer-Verlag 2013.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Shang, Tianfeng He, Qing Zhuang, Fuzhen Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate School Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9783642374005

Collab.rative filtering is one of the most popular techniques in recommender systems, and the key point is to find similar users and items. There are already some similarity measures, such as vector cosine similarity and Pearson's correlation coefficient, and so on. However, in some cases, what recommender systems get are not the ratings, but preference sequences of users on a series of items. For this type of data, those traditional similarity measures may fail to meet the practical application requirements. In this paper, a similarity measure based on inversion is proposed for preference sequences naturally. Based on the Inversion similarity measure, some structural information of user preference sequences is analyzed. By merging average precision and weighted inversion into similarity computation, a new similarity measure based on preference sequences is proposed for collab.rative filtering. Experimental results show that the proposed similarity measure based on preference sequences outperforms the common similarity measures on the datasets with continuous real numbers. © 2013 Springer-Verlag.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

A reputation management approach for resource constrained trustee agents

A reputation management approach for resource constrained tr...

引用

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Yu, Han Miao, Chunyan An, Bo Leung, Cyril Lesser, Victor R. Nanyang Technological University Singapore Singapore Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of British Columbia Canada University of Massachusetts Amherst United States

ISBN: (纸本)9781577356332

Trust is an important mechanism enabling agents to self-police open and dynamic multi-agent systems (ODMASs). Trusters evaluate the reputation of trustees based on their past observed performance, and use this information to guide their future interaction decisions. Existing trust models tend to concentrate trusters' interactions on a small number of highly reputable trustees to minimize risk exposure. When a trustee's servicing capacity is limited, such an approach may cause long delays for trusters and subsequently damage the reputation of trustees. To mitigate this problem, we propose a reputation management approach for trustee agents based on distributed constraint optimization. It helps a trustee to make situation-aware decisions on which incoming requests to serve and prevent the resulting reputation score from being affected by factors out of the trustee's control. The approach is evaluated through theoretical analysis and within a simulated, highly dynamic multi-agent environment. The results show that it can achieve close to optimally efficient utilization of the trustee agents' collective capacity in an ODMAS, promotes fair treatment of trustee agents based on their behavior, and significantly outperforms related work in enhancing social welfare.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

information spreading dynamics of the superspreaders in large opportunistic networks

引用

Journal of Computational information Systems 2013年第18期9卷 7141-7146页

作者： Yang, Wanchun Hu, Ke Zhou, Shouli Coll. of Information Eng. and Key Lab. of Intelligent Computing and Information Proc. of Edu. Min. Xiangtan University Xiangtan 411105 China Department of Physics Xiangtan University Xiangtan 411105 China College of Information Engineering Zhejiang Univ. of Technology Hangzhou 310023 China

The nodes with large degree exhibit a powerful information spreading capability in networks. It is always obvious that the popularity nodes can spread the information to more people in opportunistic networks. Many researchers try to speed up the spreading velocity by the popularity nodes. In this paper the information spreading dynamics in opportunistic networks is investigated. It is found that when the number of the network nodes is large enough, the convergence time will be approaching no matter which node first initiated the message propagation. But when the node number of the networks is small in opportunistic networks, the convergence time varies greatly when the messages are initiated by nodes with different node degree. The theory proof and the simulation results are given in this paper. © 2013 Binary information Press.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Hybrid Designing of a Neural System by Combining Fuzzy Logical Framework and PSVM for Visual Haze-Free Task

引用

International Journal of Intelligence Science 2013年第4期3卷 145-161页

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

Brain-like computer research and development have been growing rapidly in recent years. It is necessary to design large scale dynamical neural networks (more than 106 neurons) to simulate complex process of our brain. But such kind of task is not easy to achieve only based on the analysis of partial differential equations, especially for those complex neural models, e.g. Rose-Hindmarsh (RH) model. So in this paper, we develop a novel approach by combining fuzzy logical designing with Proximal Support Vector Machine Classifiers (PSVM) learning in the designing of large scale neural networks. Particularly, our approach can effectively simplify the designing process, which is crucial for both cognition science and neural science. At last, we conduct our approach on an artificial neural system with more than 108 neurons for haze-free task, and the experimental results show that texture features extracted by fuzzy logic can effectively increase the texture information entropy and improve the effect of haze-removing in some degree.

关键词： Artificial Brain Research Brain-Like Computer Fuzzy Logic Neural Network Machine Learning Hopfield Neural Network Bounded Fuzzy Operator

来源：评论

学校读者我要写书评

暂无评论

A directed continuous time random walk model with jump length depending on waiting time

The Scientific World Journal

引用

The Scientific World Journal 2014年第1期2014卷 182508页

作者： Shi, Long Yu, Zuguo Mao, Zhi Xiao, Aiguo Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China Institute of Mathematics and Physics Central South University of Forest and Technology Changsha Hunan 410004 China School of Mathematical Sciences Queensland University of Technology Brisbane QLD 4001 G.P.O. Box 2434 Australia

In continuum one-dimensional space, a coupled directed continuous time random walk model is proposed, where the random walker jumps toward one direction and the waiting time between jumps affects the subsequent jump. In the proposed model, the Laplace-Laplace transform of the probability density function P (x, t) of finding the walker at position x at time t is completely determined by the Laplace transform of the probability density function (t) of the waiting time. In terms of the probability density function of the waiting time in the Laplace domain, the limit distribution of the random process and the corresponding evolving equations are derived. © 2014 Long Shi et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The maximal relation based on a given relation schema and its concept lattice

Journal of Software

引用

Journal of Software 2013年第6期8卷 1308-1315页

作者： Lei, Yuxia Sui, Yuefei Tian, Jingying School of Computer Science Qufu Normal University Yantai Street 80 Rizhao 276826 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Architectual Engineering Rizhao Politechnic Rizhao 276826 China

Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation Rmax based on a relation schema S(A). Firstly, we analyze concepts in Rmax and the concept lattice L(Rmax), and there are some important results as follows: for any two concepts in Rmax, the union of their intents is an intent of some concept in Rmax, and further the intent of their supremum is the union of their intents;for any two concepts in Rmax, if one of them is not a sub-concept or super-concept of the other one, then the union of their extents is not an extent of any concept in Rmax;L(Rmax) is a complemented distributive lattice. Secondly, we provide the structural connection between L(R) and L(Rmax): for any relation R based on S(A), there is a supremum-preserving order-embedding map from L(R) to L(Rmax), and conversely, there is an infimum-preserving order-preserving map from L(Rmax) to L(R), which is generally not a surjective homomorphism. Thirdly, we propose two algorithms to extract concepts in R from L(Rmax), which are respectively based on intents and extents of concepts, and prove their soundness. These results have already been used to analyze the data in architectual engineering and medical science. © 2013 ACADEMY PUBLISHER.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：