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

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Liu, Ya-Bo Liu, Da-You College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)078039092X

It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is proposed. An attributes' sequential pattern is a sequence of attributes, whose values commonly occur in ascending order over data set. After each record in data set is transformed into an attributes' sequence according to their ordinal values, attributes' sequential patterns can be mined by means of mining sequential patterns. But our work is different from sequential pattern mining. One use of attributes' sequential patterns is to identify possible errors in data set for data cleaning, in which the values of attributes break the attributes' sequential patterns which most of the data conform to. Experiments verify the high efficiency of the method presented. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Using ontologies for distributed workflow management

Using ontologies for distributed workflow management

引用

IEEE International Conference on Services computing (SCC)

作者： Zhao-hui Zhang Da-you Liu Wei-Jiang Liu College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University Changchun China

In workflow systems or other applications, users need more semantic information. Ontologies and semantic Web are important technologies for managing semantic information. Our work is focused on semantic spatial information in distributed workflow. The spatial relations was described by Description Logic, the ontologies was then constructed using the RDF Schemas and OWL Capabilities. These theories and methods are enclosed in a middleware, and the middleware was embedded in workflow system of the government in Jilin Province.

关键词： Ontologies Semantic Web Logic Middleware Workflow management software Resource description framework OWL Educational technology knowledge engineering Technology management

来源：评论

学校读者我要写书评

暂无评论

Information flow security for interactive systems

引用

International Conference on Embedded and Ubiquitous computing, EUC 2005

作者： Jin, Ying Liu, Lei Zheng, Xiao-Juan Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education of P.R. China Changchun 130012 China Software College Northeast Normal University Changchun 130117 China

ISBN: (纸本)3540308075

The use of the Internet raises serious behavioural issues regarding, for example, security and the interaction among agents that may travel across links. Model-building such interactive systems is one of the biggest current challenges in computer science. A general model, action calculi, has been introduced by Robin Milner to unify the various emerging disciplines of interactive behaviour. In this paper action calculi is used as an abstraction of interactive systems and information flow security properties of such systems are studied. At first an information flow analysis for static action calculi is presented to predict how data will flow both along and inside actions and its correctness is proved;Next basing on the result of the analysis information security properties of both static and dynamic action calculi are discussed;Finally a general relationship are established between the static notation of information flow security and the dynamic one. © IFIP International Federation for Information Processing 2005.

关键词： Interactive computer systems

来源：评论

学校读者我要写书评

暂无评论

A Distributed Q-Learning Algorithm for Multi-Agent Team Coordination

A Distributed Q-Learning Algorithm for Multi-Agent Team Coor...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jing Huang Bo Yang Da-You Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Q-learning is an effective model-free reinforcement learning algorithm. However, Q-learning is centralized and competent only for single agent learning but not multi-agent learning because in later case the size of state-action space is huge and will grow exponentially with the number of agents increasing. In the paper we present a distributed Q-learning algorithm to solving this problem. In our algorithm, the tasks of learning optimal action policy are distributed to each agent in team but not a central agent. In order to reduce the size of action-state space of multi-agent team we introduce a state-action space sharing strategy of agent team, through which one agent in team can use the states already explored by other agents before and need not take time to explore these states again. Additionally, our algorithm has the ability to allocate sub-goals dynamically among agents according to environment changing, which can make agent team coordinate more efficiently. Experiments show the efficiency of our algorithm when it is applied to the benchmark problem of predator-prey pursuit game, also called pursuit game, in which a team of predators coordinate to capture a prey.

关键词： Machine learning algorithms Pursuit algorithms Multiagent systems Educational institutions Computer science Educational technology Laboratories knowledge engineering Computer science education Learning systems

来源：评论

学校读者我要写书评

暂无评论

Reasoning about ceteris paribus preference with constraint hierarchy framework

Reasoning about ceteris paribus preference with constraint h...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Yong-Gang Zhang Ji-Gui Sun Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with hard constraints into one constraint hierarchy, therefore one could process preferences and constraints in a single formalism with fruitful constraint solving algorithms. Furthermore, illustrates it with some examples, proves that the transformation preserves the ceteris paribus property and presents some complexity results. Finally compares it with related work and concludes the paper.

关键词： Artificial intelligence Graphical models Bayesian methods Sun Educational institutions Computer science Educational technology Laboratories knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

Hierarchical topological relations model of fuzzy raster regions

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2005年第7期42卷 1166-1172页

作者： Yu, Qiangyuan Liu, Dayou Wang, Shengsheng College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

The modeling of topological relations between spatial regions is a primary topic in spatial reasoning, geographic information systems (GIS) and spatial databases. In many geographical applications spatial regions do not always have homogeneous interiors and sharply defined boundaries, but frequently their interiors and boundaries are fuzzy. Recently, representing fuzzy spatial regions and modeling the topological relations between them plays an increasingly important theory and application role. Based on the characteristics of fuzzy regions in raster data model and the requirement of topological relations analysis in applications, a hierarchical topological relations model is proposed. The model can determine the topological relation between fuzzy raster regions on multiple levels with the values of three predicate. When predicates are evaluated within two values, it can deal with crisp raster regions as a specific case and there are 5 possible cases of topological relations. When predicates are evaluated within three values, there are 27 possible cases. There are 51 possible cases when predicates are evaluated within six values. In practical applications, the model can analyze topological relations of fuzzy raster regions according to the existing facts and the requirement. The model is wieldy in practical applications and achieves satisfactory results.

关键词： Fuzzy raster regions Hierarchical model Spatial reasoning Topological relations

来源：评论

学校读者我要写书评

暂无评论

Algorithm for generating concepts based on search space partition

引用

Ruan Jian Xue Bao/Journal of Software 2005年第12期16卷 2029-2035页

作者： Qi, Hong Liu, Da-You Hu, Cheng-Quan Lu, Ming Zhao, Liang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-based system comes from the lattice construction itself. This paper proposes a new algorithm called SSPCG (search space partition based concepts generation) based on the closures search space partition. The algorithm divides the closures search space into several subspaces in accordance with the criterions prescribed ahead, and introduces an efficient scheme to recognize the valid ones, which bounds searching just in these valid subspaces. An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the partition of the search space is recursive and the searching in subspaces is independent, a parallel version can be directly reached. The algorithm is experimental evaluated and compared with the famous NextClosure algorithm proposed by Ganter for random generated data, as well as for real application data. The results show that the algorithm performs much better than the later.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

A DYNAMIC CONSTRAINT SOLVING SCHEME FOR SEMI ON-LINE SCHEDULING PROBLEMS

A DYNAMIC CONSTRAINT SOLVING SCHEME FOR SEMI ON-LINE SCHEDUL...

引用

IFIP TC12 WG12.5-Second IFIP Conference on Artificial Intelligence Applications and Innovations(AIAI2005)

作者： Juyang Zhang Jigui Sun Yonggang Zhang College of Computer Science & Technology Jiiin University Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education

Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we analyze the constraints in the semi on-line scheduling problems and introduce the concept of monotonic about constraints which appear in general dynamic constraint *** designed a generic dynamic constraint solving algorithm for solving the scheduling *** give an example of its application to semi on-line discrete resource-constrained scheduling problem(ship-loading problem).

关键词： Scheduling Semi On-line Constraint Solving Monotonic

来源：评论

学校读者我要写书评

暂无评论

Consistency check between behaviour models

Consistency check between behaviour models

引用

International Symposium on Communications and Information Technologies (ISCIT)

作者： Hongyuan Wang Tie Feng Jiachen Zhang Ke Zhang Key Laboratory Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China

In UML, a modeling language popularly used to describe models at different abstraction levels, sequence diagram and statechart are both used to represent systems' behavior models. A consistency problem may arise due to the fact that sequence diagram represent interactive behavior of all objects, whereas statechart represent the complete behavior of one specific object. This paper proposes an approach checking the consistency between sequence diagrams and state diagrams. In our approach, statechart is formalized using finite state processes and sequence diagram is represented using messages trace. An existing tool LTSA is used to support our method.

关键词： Object oriented modeling Unified modeling language Laboratories knowledge engineering Computer science education Systems engineering education Educational institutions Computer science Educational technology Software design

来源：评论

学校读者我要写书评

暂无评论

An algorithm for reduct of Boolean functions based on primes

An algorithm for reduct of Boolean functions based on primes

引用

International Conference on Electrical engineering, computing Science and Automatic Control (CCE)

作者： Xiongfei Li Hui Liu Qiangqiang Wang Guilin Zhang Key Laboratory of Symbolic Computation & Knowledge Engineering Jilin University Changchun China State Key Laboratory for Novel Software Technology Nanjing University Najing China

The reduct of Boolean functions is widely used in many applications, for example: digital circuits. In this paper, we present an approach, which is based on primes, to representing the Boolean system. We present an algorithm for reduct of Boolean functions based on primes, and the cost of the algorithm is analyzed to indicate that the algorithm is efficient.

关键词： Boolean functions Data structures Arithmetic Digital circuits Laboratories Algorithm design and analysis Artificial intelligence knowledge engineering Application software Cost function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：