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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Verilog combinational equivalence checking based on smt constraint solver

引用

ICIC Express Letters, Part B: Applications 2011年第5期2卷 1087-1092页

作者： Zeng, Hailin Ouyang, Dantong Zhang, Yuehua Zhang, Liming Zhang, Guiling School of Computer Science and Technology Jilin University No. 2699 Qanjin Street Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University No. 2699 Qanjin Street Changchun 130012 China Software College Jilin University No. 2699 Qanjin Street Changchun 130012 China

Most previous works on combinational equivalence checking use BDDs and other Boolean level representations to formulate and solve the problem, and therefore, not utilizing the word-level information inherently presents in the design. To overcome this limitation, word level proof techniques like Satis ability Module Theory (SMT) were proposed. The SMT can efficiently handle the designs containing word-level arithmetic operators and bit-level Boolean logic. In this paper, we present a technique checking the equivalence of two combinational circuits based on SMT constraint solver. The experimental results indicate that our method can utilize word-level information to speed up the process of verification and result in a decrease in memory usage. © 2011 ISSN 2185-2766.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

Optimization strategy of top-down join enumeration on modern multi-core CPUs

引用

Journal of Computers 2011年第10期6卷 2004-2012页

作者： Zuo, Wanli Chen, Yongheng He, Fenglin Chen, Kerui Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China

Most contemporary database systems query optimizers exploit System-R's bottom-up dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant subplans. The distinguished exceptions are Volcano/Cascades using transforms to generate new plans according to a topdown approach. As recent research has revealed, bottom-up dynamic programming can improve performance with respect to the shape of the join graph and parallelism. However top-down join enumeration dynamic programming method can derive upper bounds for the costs of the plans it generates which is not available to typical bottom-up DP method. In this paper, we propose a comprehensive and practical framework for parallelizing top-down dynamic programming query optimization with complex non-inner join in the multi-core processor architecture, referred as PTDhyp. We have implemented such a search strategy and experimental results show that can improve optimization time effective compared to known existing algorithms. © 2011 ACADEMY PUBLISHER.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Image annotation refinement using dynamic weighted voting based on mutual information

Journal of Software

引用

Journal of Software 2011年第11 SPEC. ISSUE期6卷 2239-2246页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations. © 2011 ACADEMY PUBLISHER.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

A verifiable multi-secret sharing scheme

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2011年第SUPPL.1期32卷 120-123页

作者： Wang, Yan-Xi Liu, Yan-Heng Wang, Jian Dong, Tian-Zhe College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Analyzing two improved YCH schemes and a multi-secret sharing scheme based on homogeneous linear recursion, we propose and implement a new verifiable multi-secret sharing model based on Shamir secret sharing. The time complexity of this model in the phase of secrets recovery is O(k×t2), which is superior to other two improved YCH models (O(t3) (t>k) O(k3) (t≤k), O(k×(n+k)2)), and the time of secrets synthesis in the actual simulation is less than that of the other three models. Further, we compare the advantages and disadvantages of the four models on the time complexity, verifiability and open values. When n>k, the open values the new model needs are fewer than those of the other two improved YCH models. The experimental results show that the new model is better than the other three models on the time of secrets recovery.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

A fuzzy adaptive multi-population parallel genetic algorithm for spam filtering

引用

Journal of Convergence Information Technology 2011年第2期6卷 172-182页

作者： Zhao, Zheng-dong Wang, Gang Zhao, Wei Chen, Hui-ling Zhao, Wei Li, Lu-lu Network Information Center Changchun University of Science and Technology Changchun 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 Department of Information Engineering Jilin Police College China Branch Institute of information technology Changchun Vocational Institute of Technology Changchun China

Nowadays, e-mail is one of the most inexpensive and expeditious means of communication. However, a principal problem of any internet user is the increasing number of spam, and therefore an efficient spam filtering method is imperative. Feature selection is one of the most important factors, which can influence the classification accuracy rate. To improve the performance of spam prediction, this paper proposes a new fuzzy adaptive multi-population parallel genetic algorithm (FAMGA) for feature selection. To maintain the diversity of population, a few studies of multi-swarm strategy are reported, whereas the dynamic parameter setting has not been considered further. The proposed method is based on multiple subpopulations and each subpopulation runs in independent memory space. For the purpose of controlling the subpopulations adaptively, we put forward two regulation strategies, namely population adjustment and subpopulation adjustment. In subpopulation adjustment, a controller is designed to adjust the crossover rate for each subpopulation, and in population adjustment, a controller is designed to adjust the size of each subpopulation. Three publicly available benchmark corpora for spam filtering, the PU1, Ling-Spam and Spam Assassin, are used in our experiments. The results of experiments show that the proposed method improves the performance of spam filtering, and is significantly better than other feature selection methods. Thus, it is proved that the multi-population regulation strategy can find the optimal feature subset, and prevent premature convergence of the population.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Using TCM in mobile terminals in internet of vehicles

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2011年第SUPPL.1期32卷 107-110页

作者： Gao, Wen-Bin Liu, Yan-Heng Wang, Jian College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

A trusted cryptography module (TCM) is introduced into vehicular electronic systems to solve security issues of a mobile terminal in the Internet of vehicles, such as authentication, integrity assessment and so on. TCM has many security features, including integrity measure, integrity report and trusted storage, which can make a vehicular electronic system achieve a trusted boot process and encrypt data and information for storage protection, thereby improving the privacy and security of vehicular platform information. Referring to the TNC(trusted network connect)architecture, we design a kind of vehicular terminal access model compatible with the TNC to authenticate and authorize the trusted vehicular platform with TCM to access Internet of vehicles. The vehicular terminal access model proposed will improve the credibility and security of the Internet of vehicles.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：