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

2011 International Conference on Computer Science and Service System, CSSS 2011

作者： Zhang, Zeliang Li, Xiongfei Yang, Chengjia Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Beihua University Jilin China

ISBN: (纸本)9781424497638

Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between characters from the frozen pictures and templates being stored. It neglects the character is changing with time. This method is very simply, but it only can classify the simple elements not the words, so it couldn't render great serves to speech recognition. Afterwards the adoption of behavioral characteristics is becoming more widespread. Because of the superior of Hidden Markov model (HMM), it can be applied in speech recognition widely. In recent years, it is also used in the research of lip-reading recognition. The classical HMM model makes two hypotheses: hidden expropriation hypothesis: the state at t+1 is only conditioned by the state at t, not the state before;the expropriation hypothesis from hidden state to visible state: the visible state at t only conditioned by the hidden state at t, not the state before. Such kind of hypothesis is not very reasonable in some practical application (such as lip-reading). In some kind condition, the state at t is not only conditioned by t-1, but also t-2. Therefore this thesis revises the assumed condition classical HMM to derive a new HMM model and algorithm, and applying it into lip-reading recognition to increase the discrimination. © 2011 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

An Approach for Calculating Semantic Similarity between Words Using WordNet

An Approach for Calculating Semantic Similarity between Word...

引用

International Conference on Digital Manufacturing and Automation (ICDMA)

作者： Dou Hao Wanli Zuo Tao Peng Fengling He College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process that is people prefer to consider more differences when the semantic distance between two word is closer, and vice versa. At last, we weigh up our model against a benchmark set by human similarity judgment, and obtain a much improved result compared with other methods.

关键词： Semantics Humans computational modeling Correlation educational institutions Benchmark testing Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

A study on improved hidden Markov models and applications to speech recognition

A study on improved hidden Markov models and applications to...

引用

International Conference on Computer Science and Service System (CSSS)

作者： Zeliang Zhang Xiongfei Li Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Beihang University Jilin China

Visual voice lip-reading, so the computer can understand what the speakers want to express direction by looking at their lips. Lip reading is the easiest way to compare the early characters and templates from the frozen image is stored. It ignores the very nature and time changes. This method is very simple, but it's just simple elements can be classified, then it may not show significant speech recognition services. Behavior was characterized by more and more common. Because of the hidden Markov model is superior (HMM), which can be widely used in speech recognition. In recent years, is also used to lip reading identification. Classical HMM model, so that the two assumptions: hidden assumptions collected: in t+1 the state can only be in this country is not in the state before t; from the hidden visible state hypothesis: only by regulating the t hide the visible state, rather than the previous state. This hypothesis is not very useful in some applications (such as lip reading) is reasonable. Under certain conditions, in the t state not only limits the t-1, but also t-2. Therefore, this study modified the assumptions of the classical HMM to derive a new HMM model and algorithms, and applied to the lip-reading recognition is increasing discrimination.

关键词： Hidden Markov models Mouth Speech recognition Cost accounting Training Viterbi algorithm Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Communities Detection with Applications to Real-World Networks Analysis

Communities Detection with Applications to Real-World Networ...

引用

International Conference on computational Intelligence and Security

作者： Bo Yang School of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions of networks. Previously, we have proposed a probabilistic algorithm called the NCMA to efficiently as well as effectively mine communities from real-world networks. Here, we show that the NCMA can be readily extended and applied to address a wide range of network oriented applications beyond community detection including ranking, characterizing and searching real world networks.

关键词： Communities Probability distribution Dolphins Social network services Probabilistic logic Prediction algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Genetic Process Mining Algorithm

A Heuristic Genetic Process Mining Algorithm

引用

International Conference on computational Intelligence and Security

作者： Jiafei Li Jihong OuYang Mingyong Feng Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN Industry Applications Department Cattsoft Technology Company Limited Beijing China

The current GPM algorithm needs many iterations to get good process models with high fitness which makes the GPM algorithm usually time-consuming and sometimes the result can not be accepted. To mine higher quality model in shorter time, a heuristic solution by adding log-replay based crossover operator and direct/indirect dependency relation based mutation operator is put forward. Experiment results on 25 benchmark logs show encouraging results.

关键词： Data mining Genetics Heuristic algorithms computational modeling Process control Industries Measurement

来源：评论

学校读者我要写书评

暂无评论

A novel framework for gene selection

引用

International Journal of Advancements in Computing Technology 2011年第3期3卷 184-191页

作者： Zhao, Wei Wang, Gang Wang, Hong-bin Chen, Hui-ling Dong, Hao Zhao, Zheng-dong Network Information Center Changchun University of Science and Technology Changchun 130022 China College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Microarray data are highly redundant and noisy, and most genes are believed to be uninformative with respect to studied classes, as only a fraction of genes may present distinct profiles for different classes of samples. This paper proposed a novel hybrid framework (NHF) for the classification of high dimensional microarray data, which combined information gain(IG), F-score, genetic algorithm(GA), particle swarm optimization(PSO) and support vector machines(SVM). In order to identify a subset of informative genes embedded out of a large dataset which is contaminated with high dimensional noise, the proposed method is divided into three stages. In the first stage, IG is used to construct a ranking list of features, and only 10% features of the ranking list are provided for the second stage. In the second stage, PSO performs the feature selection task combining SVM. F-score is considered as a part of the objective function of PSO. The feature subsets are filtered according to the ranking list from the first stage, and then the results of it are supplied to the initialization of GA. Both the SVM parameter optimization and the feature selection are dynamically executed by PSO. In the third stage, GA initializes the individual of population from the results of the second stage, and an optimal result of feature selection is gained using GA integrating SVM. Both the SVM parameter optimization and the feature selection are dynamically performed by GA. The performance of the proposed method was compared with that of the PSO based, GA based, Ant colony optimization (ACO) based and simulated annealing (SA) based methods on five benchmark data sets, leukemia, colon, breast cancer, lung carcinoma and brain cancer. The numerical results and statistical analysis show that the proposed approach is capable of selecting a subset of predictive genes from a large noisy data set, and can capture the correlated structure in the data. In addition, NHF performs significantly better than th

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A Loss Assessment Design Method Based on SOA for Insurance Informationization

A Loss Assessment Design Method Based on SOA for Insurance I...

引用

International Conference on Digital Manufacturing and Automation (ICDMA)

作者： Niya Li Jian Zhang Wei Lv Chengye Jin Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Jilin University Changchun Jilin CN College of Computer Science and Technology Jilin University China LeJin Electronics Company Limited Jilin China

The loss assessment is an important operation of claim process in insurance industry. On the growing tide of making the insurance information system the in-depth support to optimizing operation and serving insurant, a methodological framework for the loss assessment is given based on SOA technology, Under the framework, the operation process design, the client design, the service design and the database design are given. These design results have been validated by an actual application system.

关键词： Insurance Databases Companies Information systems Service oriented architecture Design methodology

来源：评论

学校读者我要写书评

暂无评论

H function based tamper-proofing software watermarking scheme

Journal of Software

引用

Journal of Software 2011年第1期6卷 149-155页

作者： Zhu, Jianqi Liu, Yanheng Wang, Aimin Yin, Kexin College of Computer Science and technology Ministry of Education Jilin University Changchun China Key Laboratory of Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China College of computer and science and engineering ChangChun University of Technology Changchun China

A novel constant tamper-proofing software watermark technique based on H encryption function is presented. First we split the watermark into smaller pieces before encoding them using CLOC scheme. With the watermark pieces, a many-to-one function (H function) as the decoding function is constructed in order to avoid the pattern-matching or reverse engineering attack. The results of the function are encoded into constants as the parameters of opaque predicates or appended to the condition branches of the program to make the pieces relevant. The feature of interaction among the pieces improves the tamper-proofing ability because there being one piece destroyed, the program will not work correctly. The simulation shows that the performance of the proposed scheme is good and can resist many kinds of attacks. © 2011 ACADEMY PUBLISHER.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

An adaptive fuzzy ant colony optimization for feature selection

引用

Journal of computational Information Systems 2011年第4期7卷 1206-1213页

作者： Liu, Yuanning Wang, Gang Chen, Huiling Zhao, Zhengdong Zhu, Xiaodong Liu, Zhen College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Network Center Changchun University of Science and Technology Changchun 130022 China Graduate School of Engineering Nagasaki Institute of Applied Science Japan

Standard pattern classifiers perform on all data features. Whereas, some of the features are redundant or irrelevant, which reduce prediction accuracy, and increase running time of classifier. The purpose of this study is to search optimal feature subset, in order to increase the classification performance. The feature selection problem differs from traditional optimization problem on the problem size, namely the searching space or the problem dimension. Thus it is easy to converge at a local optimum by means of the ant colony optimization (ACO) based method with static parameter settings, but the adaptive parameter control strategy can balance between exploration and exploitation in the search space to intelligently improve solutions and avoid premature convergence. Only little research has been reported to adjust parameters of ACO adaptively. This paper proposes a novel adaptive fuzzy ant colony optimization (AFACO) based method for feature selection. We design two fuzzy controllers to adjust parameters of ACO, namely pheromone evaporation rate and the number of ants. The performance of the proposed method is compared with that of the Standard ACO based, Standard particle swarm optimization (PSO) based and genetic algorithm (GA) based methods on 10 benchmark data sets, taken from UCI machine learning and StatLog databases. The experimental results show that the proposed method outperforms the other methods in prediction accuracy, and is efficient and effective for feature selection problem. Copyright © 2011 Binary Information Press.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Robust and efficient annotation based on ontology evolution for deep web data

引用

Journal of Computers 2011年第10期6卷 2029-2036页

作者： Chen, Kerui Zuo, Wanli Zhang, Fan He, Fengling Chen, Yongheng Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China College of Information Engineering Zhongzhou University Zhengzhou 450044 China

Among those researches in Deep Web, compared to research of data extraction which is more mature, the research of data annotation is still at its preliminary stage. Currently, although the approach of applying ontology in data annotating has been approved by most researchers, there are many weaknesses existed, such as the complexity of the ontology, as well as the limitation on static ontology's ability to annotate new pages. Respond to those problems, this paper proposes a robust, highly efficient data annotation method based on ontology evolution. It needs to be noticed that this paper defines a simpler ontology which can improve annotating efficiency significantly. Experiments indicate that this method could improve the accuracy and efficiency of data annotation. © 2011 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：