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

Integrity constraints in OWL ontologies based on grounded circumscription

Frontiers of Computer Science 2013年第6期7卷 812-821页

作者： Dantong OUYANG College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China National Engineering Research Center of Geophysics Exploration Instruments Changchun 130026 China

The extensions for logic-based knowledge bases with integrity constraints are rather popular. We put forward an alternative criteria for analysis of integrity constraints in Web ontology language （OWL） ontology under the closed world assumption. According to this criteria, grounded circumscription is applied to define integrity constraints in OWL ontology and the satisfaction of the integrity constraints by minimizing extensions of the predicates in integrity con- straints. According to the semantics of integrity constraints, we provide a modified tableau algorithm which is sound and complete for deciding the consistency of an extended ontol- ogy. Finally, the integrity constraint validation is converted into the corresponding consistency of the extended ontology. Comparing our approach with existing integrity constraint validation approaches, we show that the results of our approach are more in accordance with user requirements than other approaches in certain cases.

关键词： semantic Web description logic ontology integrity constraints grounded circumscription

来源：评论

学校读者我要写书评

暂无评论

Development of a multi-objective genetic algorithm for MDO problem

引用

Journal of Information and computational Science 2013年第6期10卷 1603-1612页

作者： Yao, Yifeng Yan, Pu Liu, Dayou 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

engineering systems have become quite complicated in recent days. The requirements of design are complex and it is hard to meet them by considering only one discipline. In this paper, we suggest a hybrid Multi-objective Genetic Algorithm (MOGA) for a Multidisciplinary Design Optimization (MDO) model in engineering design. In order to get Pareto optimal solutions, we use local search to enhance the efficiency and effectiveness. We solve a problem of airplane wings optimization using MOGA. After compared with other MDO algorithms, we find the result shows that the proposed algorithm's performance has an advantage over previous work for these MDO problems. As the algorithm is evaluated based on practical data, we show that the approach can be used to solve MDO problems in the real world. Copyright © 2013 Binary Information Press.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Hybrid TS-DE Algorithm for Reliability Redundancy Optimization Problem

A Hybrid TS-DE Algorithm for Reliability Redundancy Optimiza...

引用

The 6th International Conference on Computer Research and Development

作者： Yubao Liu Guihe Qin College of Computer Science and Technology Jilin UniversityChangchunChina College of Computer Science and TechnologyChangchun University College of Computer Science and Technology Jilin UniversityChangchunChina Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin University

In this paper, a hybrid TS-DE algorithm based on Tabu search and differential evolution algorithm is proposed to solve the reliability redundancy optimization problem. A differential evolution algorithm is embedded in Tabu search algorithm. TS is applied for searching solutions space, and DE is used for generating neighborhood solutions. The advantages of both algorithms are considered simultaneously. And an adaptive hybrid TS-DE approach is developed to solve three benchmark reliability redundancy allocation problems. By comparing with other algorithms reported in previous literatures, experimental results show that the proposed method is effective and efficient for solving the reliability redundancy optimization problem.

关键词： nonlinear programming Tabu search differential evolution reliability optimization redundancy allocation

来源：评论

学校读者我要写书评

暂无评论

Modeling and Mining Spatiotemporal Social Contact of Metapopulation from Heterogeneous Data

Modeling and Mining Spatiotemporal Social Contact of Metapop...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Bo Yang Hongbin Pei Hechang Chen Jiming Liu Shang Xia School of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Department of Computer Science Hong Kong Baptist University Hong Kong National Institute of Parasitic Diseases Chinese CDC Shanghai China

ISBN: (纸本)9781479943012

During an epidemic, the spatial, temporal and demographical patterns of disease transmission are determined by multiple factors. Besides the physiological properties of pathogenes and hosts, the social contacts of host population, which characterize individuals' reciprocal exposures of infection in view of demographical structures and various social activities, are also pivotal to understand and further predict the prevalence of infectious diseases. The means of measuring social contacts will dominate the extent how precisely we can forecast the dynamics of infections in the real world. Most current works focus their efforts on modeling the spatial patterns of static social contacts. In this work, we address the problem on how to characterize and measure dynamical social contacts during an epidemic from a novel perspective. We propose an epidemic-model-based tensor deconvolution framework to address this issue, in which the spatiotemporal patterns of social contacts are represented by the factors of tensors, which can be discovered by a tensor deconvolution procedure with an integration of epidemic models from rich types of data, mainly including heterogeneous outbreak surveillance, social-demographic census and physiological data from medical reports. Taking SIR model as a case study, the efficacy of the proposed method is theoretically analyzed and empirically validated through a set of rigorous experiments on both synthetic and real-world data.

关键词： educational institutions Diseases Sociology Statistics Tensile stress Surveillance Data models

来源：评论

学校读者我要写书评

暂无评论

Research and implementation of improved real-time crawler modeling

Research and implementation of improved real-time crawler mo...

引用

International Conference on Electrical Information and Mechatronics, ICEIM 2012

作者： Zuo, Xianglin Wang, Wenbo Wang, Ying Zuo, Wanli College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China

ISBN: (纸本)9783037856901

The past decade has witnessed the rapid development of search engines, which has become an indispensable part of everyday life. However, people are no longer satisfied with accessing to ordinary information, and they may instead pay more attention to fresh information. This demand poses challenges to traditional search engines, which concern more about relevance and importance of web pages. A search engine compresses three modules: crawler, indexer and searcher. Changes are needed for all these three parts to improve search engine's freshness. This paper investigates the first part of search engine - crawler, we analyze the requirements for real-time crawler, and propose a novel real-time crawler based on more accurate estimation of refresh time. Experimental results demonstrate that the proposed real-time crawler can help search engine improve its freshness. © (2013) Trans Tech Publications, Switzerland.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

A priority queue algorithm for the replication task in HBase

Journal of Software

引用

Journal of Software 2013年第7期8卷 1765-1769页

作者： Zhang, Changlun Wang, Kaixuan Mu, Haibing Science School Beijing University of Civil Engineering and Architecture Beijing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Electronics and Information Engineering Beijing Jiaotong University Beijing China

The replication of the non-structure data from one data center to another is an urgent task in HBase. The paper studies the priority growth probability of the priority replication queue and proposed a dynamic priority replication task queue algorithm based on the earliest deadline first algorithm (EDF). The experiment results show that the proposed algorithm can balance the replication overhead between the high and low priority tasks and avoid the low priority task starving to death as well as ensure the high priority task's interests. © 2013 ACADEMY PUBLISHER.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

Superpixels Based Interactive Image Segmentation Algorithm

Superpixels Based Interactive Image Segmentation Algorithm

引用

2013 International Conference on Information,Business and education Technology(ICIBET 2013)

作者： LONG Jian-wu SHEN Xuan-jing ZANG Hui CHEN Hai-peng College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

ISBN: (纸本)9781629932101

A superpixels based interactive image segmentation algorithm is proposed in this paper. Firstly the initial segmentation is obtained by MeanShift algorithm, and then a graph is built using pre-segmented regions as nodes, finally min-cut/maxflow algorithm is implemented for global solution. In this process, each region is represented by a color histogram and Bhattacharyya coefficient is chosen to calculate the similarity between any two regions. Extensive experiments are performed and the results show that the presented algorithm obtains much more satisfactory segmentation results with less user interaction and less comsuming time than MSRM algorithm.

关键词： interactive image segmentation graph cut mean shift

来源：评论

学校读者我要写书评

暂无评论

Adaptive Image Thresholding by Background Subtraction

Adaptive Image Thresholding by Background Subtraction

引用

2013 International Conference on Information,Business and education Technology(ICIBET 2013)

ISBN: (纸本)9781629932101

In this paper, an adaptive image thresholding algorithm is proposed for thresholding images with uneven illumination. Firstly, a Gaussian scale space, which is produced from the convolution of a two-dimensional Gaussian function with an input image, is used to estimate the background image. Followed by background subtraction, the objective image can be easily obtained to eliminate interference of uneven illumination. Thirdly, to highlight those darker objects, gamma correction is employed to enhance the objective image. Finally, the thresholding result is extracted easily using the global valley-emphasis Otsu method. The experimental results show that the introduced method yields satisfactory visual quality.

关键词： thresholding background estimation background subtraction

来源：评论

学校读者我要写书评

暂无评论

Representation for topological relations between a concave region and two simple regions

引用

Journal of computational Information Systems 2013年第4期9卷 1633-1640页

作者： Li, Jian Ouyang, Jihong Liao, Menglan Wan, Baocheng College of Computer Science and Technology Jilin University Changchun 130012 China Information Technology College Jilin Agricultural University Changchun 130118 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

An extended 4-intersection matrix is defined to represent the RCC5 relation based on the classical 4-intersection matrix. On the basis of the extended 4-intersection matrix, the 16-intersection matrix is then derived, through which a model for representing and reasoning of topological relation between a concave region and two simple regions is presented. The work of this paper mainly includes: the algorithm is given to calculate the topological relation between a concave region and two simple regions, and 161 topological relations are obtained through the program, and all of these 161 topological relations are realizable. The exclusiveness and completeness of these 161 basic relations are also proved. Through the comparison, the model which we presented is more expressive than the other models of similar study. Copyright © 2013 Binary Information Press.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Representation and reasoning for topological relations between a region with broad boundaries and a simple region on the basis of RCC-8

引用

Journal of computational Information Systems 2013年第13期9卷 5395-5402页

作者： Li, Jian Ouyang, Jihong Liao, Menglan College of Computer Science and Technology Jilin University Changchun 130012 China College of Information Technology Jilin Agricultural University Changchun 130118 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

In this article, on the basis of RCC-8, the 9-intersection matrix is extended to 27-intersection matrix, to represent the topological relations between a region with broad boundaries and a simple region. We get 23 topological relations between a region with broad boundaries and a simple region, and give its topological relations diagram. For further study 27-intersection model, we give the conceptual neighborhood diagram and topology reasoning composite table and verify that the 23 kinds of topological relations are implemented. © 2013 by Binary Information Press.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：