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

Translation of SPARQL to SQL based on integrity constraint

Journal of computational Information Systems 2011年第2期7卷 394-402页

作者： Cui, Xianji Ouyang, Dantong Ye, Yuxin Wang, Xiaolong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Computation and Knowledge Engineering Ministry of Education China

Most existing storages of the ontology use relational databases as a backend to manage RDF data. This motivates us to translate SPARQL queries, the proposed standard for RDF querying, into equivalent SQL queries. At the basis of giving the IC-based storage to store the ontology with integrity constraints, we present the corresponding translation of SPARQL to SQL called IC-based translation. With the different structure of the tables in the relational databases, the SPARQL query statements are divided into four types. For the different type of query statements, we give the corresponding translations. Copyright © 2011 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Damaged solar cell detection based on gray-intensity wave transformation

引用

Procedia engineering 2011年 15卷 3808-3813页

作者： Xuanjing Shen Wei Wei Jianwu Long Qingji Qian Colledge 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 130012China Colledge of Physics Jilin University Changchun 130025 China

An automatic system to detect cracks of solar cells on satellite solar panel through camera has been proposed in this study. And a novel binarization method based on gray intensity wave transformation is also introduced to decrease the impact of non-uniform illumination on cell image. It adaptively classifies the pixel depending on local peak and trough on the gray intensity surface. After the cell image binareized, a strategy called “adjacency searching” is adopted to remove the gate lines. Then the ellipse fitting based on least squares is conducted on the contours of crack segments to get their angles, which are used to connect these segments into the whole crack. The experiment on 5000 cells in one panel had shown that the precision of our system has reached 98.5%, and its false alarm rate is less than 9%, which could meet the application requirements.

关键词： Satellite Solar cell Binarization Crack detection

来源：评论

学校读者我要写书评

暂无评论

Optimize diagnosability and sensor placement in discrete event system

引用

Journal of Convergence Information Technology 2011年第7期6卷 219-224页

作者： Jian, Zhao Dantong, Ouyang Xiaoyu, Wang Liming, Zhang 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 College of Computer Science and Technology Changchun University Changchun China

Diagnosability indicates that whether the fault can be detected in finite time, which is an important property in model based diagnosis. As diagnosis depends on the sensor placement and the modeling, it is hard to make a choice whether to place more sensors for testing or to compute more diagnosis pathways in practical application. In this paper, a method is proposed to resolve this by defining key point. The key points take priority on testing among the existing sensors. In these key points, the observation can be optimized and be diagnosis tested efficiently. Experimental result indicates that this method achieves efficient faults distinction and identification, and reduces the cost of sensors and the computational complexity of diagnostic in the case of normal behavior.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A Chinese online document clustering algorithm based on hidden sentiment vector

引用

Journal of computational Information Systems 2011年第6期7卷 1974-1981页

作者： Yang, Hui Wang, Zhe Zhou, Xu Wang, Zuo Zhou, Tong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education China

The core idea of clustering algorithm is the division of data into groups of similar objects. Some clustering algorithms are proven good performance on document clustering, such as k-means and UPGMA etc. However, few document clustering algorithms pay attention to the hidden sentiment which is a very important feature of the documents. This paper presents an improved k-means algorithm (HSK-Means) based on hidden sentiment vector for Chinese document clustering. Chinese dependency grammar rules are used to extract document feature and evaluate hidden sentiment. A new method for selecting initial cluster centroids based on rank mechanism of similarity is also proposed to improve accuracy of clustering algorithm. The experimental results on real online document sets illustrate that the performance of HSK-Means algorithm is better than classic document clustering algorithms. Copyright © 2011 Binary Information Press.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Eliminating repeated constraint checks in MaxRPC algorithms

引用

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

作者： Guo, Jinsong Li, Zhanshan Zhang, Liang Geng, Xuena Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University No. 2699 Qianjin Street Changchun 130012 China College of Computer Science and Technology Jilin University No. 2699 Qianjin Street Changchun 130012 China

Filtering techniques are used in Constraint Satisfaction Problems to remove all the local inconsistencies during a processing step or prune the search tree efficiently during search. Local consistencies are used as preprocessing filtering techniques. MaxRPC which can remove more values than arc consistency is not used as widely as arc consistency for its relatively expensive time cost. We discover that, in the algorithms enforcing maxRPC, there are repeated constraint checks which can affect the efficiency of the algorithm negatively. In this paper, we propose a method making use of a data structure of AC4 and the relation "stronger" between local consistencies to eliminate the repeated constraint checks. Since the repeated constraint checks can be eliminated and the time cost of enforcing maxRPC can be reduced, the applicable occasions of maxRPC should be reconsidered. © 2011 ISSN 2185-2766.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A kind of improving HMM model and using in the visual speech recognition

A kind of improving HMM model and using in the visual speech...

引用

International Conference on Computer Science and Service System (CSSS)

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

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.

关键词： Hidden Markov models Viterbi algorithm Speech recognition knowledge engineering Laboratories Electronic mail Medical services

来源：评论

学校读者我要写书评

暂无评论

Support vector description of clusters for image annotation

Support vector description of clusters for image annotation

引用

International Workshop on Advanced computational Intelligence and Intelligent Informatics, IWACIII 2011

作者： Sun, Liang Yoshida, Shinichi Ge, Hongwei Liang, Yanchun College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China School of Information Kochi University of Technology Kochi 7828502 Japan Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian 116024 China

Image annotation is a challenging problem due to the rapid growing of real world image archives. In this paper, we propose a novel approach to the solving of this problem based on a variant of the support vector clustering (SVC) algorithm, i.e., the support vector description of clusters. The system has two major components, the training process and the annotating process. In the training process, clusters of image manually annotated by descriptive words are used as training instances. Each cluster is described by a one-cluster SVC model. The proposed model can exploit the advantage of SVC for its ability to delineate cluster boundaries of arbitrary shape. Moreover, the training process of the one-cluster SVC model is formulated as the process of building density estimator for underlying distribution of the cluster. In the annotating process, for a test image, the probability of this instance being generated by each model is computed. And then the relevant words are selected based on the obtained probabilities. Simulated experiments were conducted on the Corel60k data set. The results demonstrate the performance of the proposed algorithm, compared with the performance of other algorithms.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

A kind of improving HMM model and using in the visual speech recognition

A kind of improving HMM model and using in the visual speech...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：