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

Journal of Software 2013年第5期8卷 1101-1108页

作者： Jia, Hongjie Ding, Shifei Zhu, Hong Wu, Fulin Bao, Lina School of Computer Science and Technology China University of Mining and Technology Xuzhou China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Spectral clustering has aroused extensive attention in recent years. It performs well for the data with arbitrary shape and can converge to global optimum. But traditional spectral clustering algorithms set the importance of all attributes to 1 as default, when measuring the similarity of data points. In fact, each attribute contains different information and their contributions to the clustering are also different. In order to make full use of the information contained in each attribute and weaken the interference of noise data or redundant attributes, this paper proposes a feature weighted spectral clustering algorithm based on knowledge entropy (FWKE-SC). This algorithm uses the concept of knowledge entropy in rough set to evaluate the importance of each attribute, which can be used as the attribute weights, and then applies spectral clustering method to cluster the data points. Experiments show that FWKE-SC algorithm deals with high-dimensional data very well and has better robustness and generalization ability. © 2013 ACADEMY PUBLISHER.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

2-D shape completion with shape priors

引用

Chinese Science Bulletin 2013年第27期58卷 3430-3436页

作者： GUO Ge JIANG TingTing WANG YiZhou GAO Wen Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences National Engineering Laboratory for Video Technology Key Laboratory of Machine Perception School of EECS Peking University

We propose new techniques for 2-D shape/contour completion, which is one of the important research topics related to shape analysis and computer vision, e.g. the detection of incomplete objects due to occlusion and noises. The purpose of shape completion is to find the optimal curve segments that fill the missing contour parts, so as to acquire the best estimation of the original complete object shapes. Unlike the previous work using local smoothness or minimum curvature priors, we solve the problem under a Bayesian formulation taking advantage of global shape prior knowledge. With the priors, our methods are expert in recovering significant shape structures and dealing with large occlusion cases. There are two different priors adopted in this paper: (i) A generic prior model that prefers minimal global shape transformation (including non-rigid deformation and affine transformation with respect to a reference object shape) of the recovered complete shape; and (ii) a class-specific shape prior model learned from training examples of an object category, which prefers the reconstructed shape to follow the learned shape variation models of the category. Efficient contour completion algorithms are suggested corresponding to the two types of priors. Our experimental results demonstrate the advantage of the proposed shape completion approaches compared to the existing techniques, especially for objects with complex structure under severe occlusion.

关键词：形状结构计算机视觉贝叶斯公式电子相关最佳估计最小曲率先验知识仿射变换

来源：评论

学校读者我要写书评

暂无评论

Social sensing enhanced time estimation for bus service

引用

Concurrency and Computation: Practice and Experience 2015年第15期27卷

作者： Jin Liu Juan Li Xiaohui Cui Xiaoguang Niu Xiaoping Sun Jing Zhou State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China International School of Software Wuhan University Wuhan China Computer School Wuhan University Wuhan China Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science Communication University of China China

The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEA s and road condition attributions PRCA s. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEA s of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： social sensing in-time bus service bus route arrival time estimation

来源：评论

学校读者我要写书评

暂无评论

Research and development of comprehensive communication experiment teaching system

引用

Computer Modelling and New Technologies 2014年第6期18卷 218-224页

作者： Wang, Bin Li, Dashe Liu, Shue School of Computer Science and Technology Shandong Institute of Business and Technology Yantai China Key Laboratory of Intelligent Information Processing Universities of Shandong Yantai China School of Computer Science and Technology Binzhou Medical University Yantai China

This paper has developed a set of management and experiment system for communication laboratories. Its development platform is Visual Basic 6.0, using access database, winsocket programming and multicast technology. Including several sets of software and using C/S architecture, the system can jointly work with data network configuration system so as to achieve the communication experiment of data network. It can conduct VLAN isolation and IP filter using right management switch, which can make multiple servers connect to the device simultaneously and completely control the numbers of computers entering the system at some point. By off-line configuration technology and shared online database technology, the system can make the device resources be assigned automatically to solve the basic problems of many people doing experiment at the same time.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

On the theoretical properties of bipartition dissimilarity measure

引用

Computer Modelling and New Technologies 2014年第12期18卷 322-327页

作者： Li, Shuguang Chen, Shuying Cui, Mengtian Key Laboratory of Intelligent Information Processing in Universities of Shandong Shandong Institute of Business and Technology Yantai China College of Computer Science and Technology Shandong Institute of Business and Technology Yantai China School of Computer Science and Technology Southwest University for Nationalities Chengdu China

Bipartition dissimilarity is a new measure introduced by Alix Boc et al. They proposed an algorithm for inferring horizontal gene transfer events which can rely on different optimization criteria. Simulation results suggested that the strategy based on bipartition dissimilarity provided better results than those based on other three existing tree comparison indices. However, no theoretical analysis on it has been conducted since then in the literature. The present paper reports some useful new results for this measure. The theoretical properties studied include minimum positive value, neighborhood, and local modifications.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Efficiently Finding Top-K Items from Evolving Distributed Data Streams

Efficiently Finding Top-K Items from Evolving Distributed Da...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Baoyuan Qi Gang Ma Zhongzhi Shi Wei Wang University of Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Cas Beijing China Key Lab. of Intell. Inf. Process. Institute of Computing Technology Chinese Academy of Sciences Beijing CN Beijing Lexo Technologies Co. Ltd. Beijing China

ISBN: (纸本)9781479967162

The problem of efficiently finding top-k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challenges. In this paper, we propose a method to tackle these two challenges based on space-saving and gossip-based algorithms respectively. Our method is implemented on SAMOA, a scalable advanced massive online analysis machine learning framework. The experimental results show its effectiveness and scalability.

关键词： Peer-to-peer computing Data mining Distributed databases Protocols Machine learning algorithms Monitoring Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

Recognition algorithm for plant leaves based on adaptive supervised locally linear embedding

引用

International Journal of Agricultural and Biological Engineering 2013年第3期6卷 52-57页

作者： Yan Qing Liang Dong Zhang Dongyan Wang Xiu Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei 230039China Beijing Research Center for Information Technology in Agriculture Beijing 100097China

Locally linear embedding(LLE)algorithm has a distinct deficiency in practical *** requires users to select the neighborhood parameter,k,which denotes the number of nearest neighbors.A new adaptive method is presented based on supervised LLE in this article.A similarity measure is formed by utilizing the Fisher projection distance,and then it is used as a threshold to select *** samples will produce different k adaptively according to the density of the data *** method is applied to classify plant *** experimental results show that the average classification rate of this new method is up to 92.4%,which is much better than the results from the traditional LLE and supervised LLE.

关键词： supervised locally linear embedding manifold learning Fisher projection adaptive neighbors leaf recognition Precision Agriculture

来源：评论

学校读者我要写书评

暂无评论

Step semantics and action refinement in event structures

引用

Computer Modelling and New Technologies 2014年第5期18卷 94-101页

作者： Tang, Weidong Wu, Jinzhao Liu, Meiling School of Information Science and Engineering Guangxi University for Nationalities Nanning China Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Nanning China Science Computing and Intelligent Information Processing of GuangXi higher education key laboratory Nanning China

An event structure acts as a denotational semantic model of concurrent systems. Action refinement is an essential operation in the design of concurrent systems. However, there exists an important problem about preserving equivalence under action refinement. If two processes are equivalent with each other, we hope that they still can preserve equivalence after action refinement. In linear time equivalence and branching time equivalence spectrum, step equivalences, which include step trace equivalence and step bisimulation equivalence are not preserved under action refinement [17]. In this paper, we define a class of concurrent processes with specific properties and put forward the concept of clustered action transition, which ensures that step equivalences are able to preserve under action refinement.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Neural network based bilingual language model growing for statistical machine translation

Neural network based bilingual language model growing for st...

引用

2014 Conference on Empirical Methods in Natural Language processing, EMNLP 2014

作者： Wang, Rui Zhao, Hai Lu, Bao-Liang Utiyama, Masao Sumita, Eiichro Department of Computer Science and Engineering Center for Brain-Like Computing and Machine Intelligence Shanghai Jiao Tong University Shanghai200240 China Multilingual Translation Laboratory MASTAR Project National Institute of Information and Communications Technology 3-5 Hikaridai Keihanna Science City Kyoto619-0289 Japan Key Laboratory Shanghai Education Commission Intelligent Interaction Cognitive Engineering Shanghai Jiao Tong University Shanghai200240 China

ISBN: (纸本)9781937284961

Since larger n-gram Language Model (LM) usually performs better in Statistical Machine Translation (SMT), how to construct efficient large LM is an important topic in SMT. However, most of the existing LM growing methods need an extra monolingual corpus, where additional LM adaption technology is necessary. In this paper, we propose a novel neural network based bilingual LM growing method, only using the bilingual parallel corpus in SMT. The results show that our method can improve both the perplexity score for LM evaluation and BLEU score for SMT, and significantly outperforms the existing LM growing methods without extra corpus. © 2014 Association for Computational Linguistics.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Interleaving semantics and action refinement in event structures

引用

Computer Modelling and New Technologies 2014年第6期18卷 44-51页

作者： Tang, Weidong Wu, Jinzhao Liu, Meiling Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu China School of Information Science and Engineering Guangxi University for Nationalities Nanning China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Nanning China Science Computing and Intelligent Information Processing of GuangXi higher education key laboratory Nanning China

An event structure acts as a denotational semantic model of concurrent systems. Action refinement is an essential operation in the design of concurrent systems. But there exists an important problem about preserving equivalence under action refinement. If two processes are equivalent with each other, we hope that they still can preserve equivalence after action refinement. In linear time equivalence and branching time equivalence spectrum, interleaving equivalences, which include interleaving trace equivalence and interleaving bisimulation equivalence are not preserved under action refinement [9-11, 14, 16, 21]. In this paper, we define a class of concurrent processes with specific properties and put forward the concept of clustered action transition, which ensures that interleaving equivalences are able to preserve under action refinement.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：