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

Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST)

作者： Hong Qi Liangliang Zhang Ying Gao Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Jilin University China Alcatel Lucent Shanghai Bell Company Limited China Jilin University Changchun Jilin CN

Most of the current information retrieval systems are mainly based on full text matching of keywords or topic-based classification, often return a large number of irrelevant information, and are unable to meet the user's request. Ontology-based semantic retrieval is a hot issue in current research. In this paper, the corn plant ontology is constructed using Formal Concept Analysis based approach in which the concept lattice is built from terminology-file relationship table and further reduced. Based on the corn plant ontology, we propose a semantic annotation method in which the feature words are selected by an improved method for weight calculation and the RDF triples are generated by syntactic parser. Finally a semantic retrieval system for corn plant is developed. In comparative experiment one hundred documents are selected as the dataset, and the result shows that the semantic retrieval system introduced in this paper is superior to keyword-based retrieval method in precision ratio and recall ratio.

关键词： Semantics Ontologies Information retrieval Lattices Feature extraction Resource description framework Optical wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a trusted remote remediation framework for vehicle software

Design and implementation of a trusted remote remediation fr...

引用

Chinese Control Conference (CCC)

作者： Jian Wang Bin Li Yanheng Liu College of Computer Science and Technology Jilin University Changchun P. R. China Mathemetics School Jilin University Changchun P. R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun P. R. China

With the rapid development of vehicle electronic systems, the vehicle software failure rate has also been rising over time. Providing the convenient and effective maintenance on the vehicle software has become a fundamental block constraining the progress of vehicle electronic industry. A trusted remote remediation framework for vehicle software is presented and realized to enable drivers to online upgrade version or fix bug without needing for driving the vehicles back to the factories or using the specific devices. In this framework, the trusted remediation server takes responsibility for managing and providing the patch programs and the trusted remediation client can download directly from the remediation server to upgrade programs or fix software errors, achieving the self-repair in complex vehicular networks.

关键词： Vehicles Authentication File systems Servers Universal Serial Bus

来源：评论

学校读者我要写书评

暂无评论

Using SROIQB to model and compose semantic Web service

引用

Tongxin Xuebao/Journal on Communications 2010年第8 A期31卷 1-9页

作者： Liu, Da-You Liu, Si-Pei Qi, Hong 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

One kind of semantic Web service modeling and reasoning method based on description logic with Boolean role constructors (SROIQB) was introduced. By using DL to figure out the hyponymy relationship between concepts in domain ontology and model Web service functional semantic in ServiceProfile, and define Boolean role expressions to describe the composition process in ProcessProfile respectively. Furthermore, Boolean role expression is introduced to describe all possible composition structures of atomic services and then semantic Web service composition can be regarded as a process of consistence checking and class subsumption computing reasoning on DL knowledge base. Thus the comparison and example validation show that introduced one kind of new and reasonable semantic Web service modeling and composition method in the framework of semantic Web by using SROIQB, which with more strong expressive capability and decidable type inference.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A NEW CASCADING FAILURE MODEL WITH DELAY TIME IN CONGESTED COMPLEX NETWORKS

引用

Journal of Systems Science and Systems engineering 2009年第3期18卷 369-381页

作者： Jian WANG Yanheng LIU Yu JIAO 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

Cascading failures often occur in congested complex networks. Cascading failures can be expressed as a three-phase process： generation, diffusion, and dissipation of congestion. Different from the betweenness centrality, a congestion function is proposed to represent the extent of congestion on a given node. Inspired by the restart process of a node, we introduce the concept of ＂delay time,＂ during which the overloaded node Cannot receive or forward any traffic, so an intergradation between permanent removal and nonremoval is built and the flexibility of the presented model is demonstrated. Considering the connectivity of a network before and after cascading failures is not cracked because the overloaded node are not removed from network permanently in our model, a new evaluation function of network efficiency is also proposed to measure the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability, and traffic generation speed on congestion propagation. Cascading processes composed of three phases and some factors affecting cascade propagation are uncovered as well.

关键词： Complex networks cascading failures congestion effects propagation model

来源：评论

学校读者我要写书评

暂无评论

Deriving all minimal consistency-based diagnosis sets using SAT solvers

引用

Progress in Natural Science:Materials International 2009年第4期19卷 489-494页

作者： Xiangfu Zhao a,b, Liming Zhang a,b, Dantong Ouyang a,b, Yu Jiao a,b a key laboratory of symbolic computation and knowledge engineering of Ministry of Education, Jilin University, Changchun 130012, China b School 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 School of Computer Science and Technology Jilin University Changchun 130012 China

In this paper, a novel method is proposed for judging whether a component set is a consistency-based diagnostic set, using SAT solv- ers. Firstly, the model of the system to be diagnosed and all the observations are described with conjunctive normal forms (CNF). Then, all the related clauses in the CNF files to the components other than the considered ones are extracted, to be used for satisfiability checking by SAT solvers. Next, all the minimal consistency-based diagnostic sets are derived by the CSSE-tree or by other similar algorithms. We have implemented four related algorithms, by calling the gold medal SAT solver in SAT07 competition – RSAT. Experimental results show that all the minimal consistency-based diagnostic sets can be quickly computed. Especially our CSSE-tree has the best effciency for the singleor double-fault diagnosis.

关键词： Conjunctive normal form Consistency-based diagnosis Model-based diagnosis SAT solver

来源：评论

学校读者我要写书评

暂无评论

Computing minimal diagnosis with binary decision diagrams algorithm

Computing minimal diagnosis with binary decision diagrams al...

引用

6th International Conference on Fuzzy Systems and knowledge Discovery, FSKD 2009

作者： Wang, Kun Li, Zhan-Shan Ai, Yang Zhang, Yong-Gang Key Laboratory of Symbolic Computation Knowledge Engineering for Ministry of Education Jilin University Jilin Changchun China

ISBN: (纸本)9780769537351

In this paper we propose an algorithm of computing minimal diagnosis based on BDD (Binary Decision Diagram). First we give the concept of disjunction equations, and map the collection of conflict sets into disjunction equations, then we compile the system into a BDD, further we compute the minimal hitting sets by solving the BDD and minimizing hitting sets. The reliability and completeness of the algorithm are proved. Variable ordering and construct controlling of BDD are used to further reduce the size of final BDD and the number of non-minimal hitting sets to be generated. The efficiency of computing minimal hitting sets is highly improved. Experimental results show that the algorithm isn't restricted by the structure of system and conflict sets, compared with three algorithms in the references, it can generate all the minimal hitting sets, and it works well in random circumstances. © 2009 IEEE.

关键词： Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

An approach to accelerate diagnosis by isomorphic determining

An approach to accelerate diagnosis by isomorphic determinin...

引用

2009 International Conference on Information engineering and Computer Science, ICIECS 2009

作者： Wang, Xiaoyu Ouyang, Dantong Feng, Yuxuan Zhao, Jian College of Computer Science and Technology Jilin University Key Laboratory Symbolic Computation and Knowledge Engineering Ministry of Educaion Changchun China

ISBN: (纸本)9781424449941

When diagnosing dynamic system represented as discrete-event systems, it needs to find what happened to the systems from observations. The behavior of system could be represented by automaton model. The diagnostic task consists in determining the models compatible with the observations, but the global computation which is needed in synchronization costs exponential time. In this paper we propose a new method to simplify the automaton by isomorphic determining. The cost of computation will be significantly cut down by merging the automatons with the same structure, and the time-complexity of the diagnosis process could be reduced by the method. ©2009 IEEE.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A model for representing topological relations between regions with holes

A model for representing topological relations between regio...

引用

1st International Conference on Information Science and engineering, ICISE2009

作者： Huo, Linlin Ouyang, Jihong Liu, Dayou College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9780769538877

This paper proposes a unified model - D9-intersection model to represent topological relations between regions with holes. D9-intersection model can describe simple regional relations as accurately as 9-intersection model. When holes are allowed, D9-intersection model can distinguish relations that 9 - intersection could not and then be more expressive than 9-intersection model. In addition, we present the reasoning method based on D9-intersection model restricting to regions with at most one hole. ©2009 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

K-means on commodity GPUs with CUDA

K-means on commodity GPUs with CUDA

引用

2009 WRI World Congress on Computer Science and Information engineering, CSIE 2009

作者： Bai, Hong-Tao He, Li-Li Ouyang, Dan-Tong Li, Zhan-Shan Li, He College of Computer Science and Technology Jilin University 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University 130012 China

ISBN: (纸本)9780769535074

K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, while almost all of them are based on Single Instruction Single Data (SISD) architecture processors (CPUs), which partly ignored the inherent paralleled characteristic of the algorithms. In this paper, a novel Single Instruction Multiple Data (SIMD) architecture processors (GPUs) based k-means algorithm is proposed. In this algorithm, in order to accelerate compute-intensive portions of traditional k-means, both data objects assignment and k centroids recalculation are off-loaded to the GPU in parallel. We have implemented this GPU-based k-means on the newest generation GPU with Compute Unified Device Architecture (CUDA). The numerical experiments demonstrated that the speed of GPU-based k-means could reach as high as 40 times of the CPU-based k-means. © 2008 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

MAX-MIN ant system on GPU with CUDA

MAX-MIN ant system on GPU with CUDA

引用

2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

作者： Bai, Hongtao Ouyang, Dantong Li, Ximing He, Lili Yu, Haihong College of Computer Science and Technology Jilin University 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University 130012 China

ISBN: (纸本)9780769538730

We propose a parallel MAX-MIN Ant System (MMAS) algorithm that is suitable for an implementation on graphics processing units (GPUs). Multi ant colonies with respective parameter settings are whole offloaded to the GPU in parallel. We have implemented this GPU-based MMAS on the GPU with compute unified device architecture (CUDA). Some performance optimization means for kernel program of GPU are introduced. Experimental results that are based on simulations for the traveling salesperson problem are presented to evaluate the proposed techniques. © 2009 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：