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

CBR and micro-architecture antipatterns based software design improvement

IFIP TC12 1st International Conference on Artificial Intelligence Applications and Innovations, AIAI 2004

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

ISBN: (纸本)1402081502

This paper presents a Case Based Reasoning (CBR) approach to identifying micro-architecture anti-patterns and replacing them with "good" patterns in order to improve the design of software system. The resulting system design benefits from better flexibility for adapting to future requirement change and expansion. In this approach, both problematic inflexible structures and their corresponding refactoring designs are formally defined and organized in a case base. The identification of anti-patterns is carried out through similarity measurement on class diagrams, sequence diagrams, OO quality metric and semantic constraints. A supporting system CBDIT was developed to aid this approach. © 2004 Springer Science + Business Media, Inc.

关键词： Case based reasoning

来源：评论

学校读者我要写书评

暂无评论

Solving constrained traveling salesman problems by genetic algorithms

引用

自然科学进展(英文版) 2004年第7期14卷 631-637页

作者： WU Chunguo LIANG Yanchun LEE Heowpueh LU Chun LIN Wuzhong College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education of China Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore

Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.

关键词： constrained traveling salesman problem genetic algorithm Hamiltonian path open route fixed end

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal database with multi-granularities

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3129卷 137-146页

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

Spatio-temporal information process grows up quickly in these years. Although uncertain and multi-granularities is the common features of spatio-temporal data, those problems were not well solved yet. A new spatio-temporal granularity representation method which supports multiple granularities and uncertain spatio-temporal objects is put forward. Then this method is applied to a spatio-temporal database ASTD. By supporting multiple granularities and approximate region, ASTD can process the multiple level data together, perform the query in variant precision and handle uncertainty. Compared with similar systems, ASTD is more powerful in multiple granularities, uncertainty, object type and granularity operations. © Springer-Verlag 2004.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

A hybrid algorithm for combining forecasting based on AFTER-PSO

A hybrid algorithm for combining forecasting based on AFTER-...

引用

8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence

作者： Feng, Xiaoyue Liang, Yanchun Sun, Yanfeng Lee, Heow Pueh Zhou, Chunguang Wang, Yan Key Laboratory of Symbol Computation and Knowledge Engineering Juin University Ministry of Education Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore

ISBN: (纸本)3540228179

A novel hybrid algorithm based on the AFTER (Aggregated forecast through exponential re-weighting) and the modified particle swarm optimization (PSO) is proposed. The combining weights in the hybrid algorithm are trained by the modified PSO. The linear constraints are added in the PSO to ensure that the sum of the combining weights is equal to one. Simulated results on the prediction of the stocks data show the effectiveness of the hybrid algorithm. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Study on optimization of agent initial positions in land combat simulation

引用

自然科学进展(英文版) 2004年第3期14卷 257-261页

作者： WU Chunguo LIANG Yanchun LEE Heow Pueh LU Chun Yang Xiaowei College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore Department of Applied Mathematics South China University of Technology Guangzhou 510640 China Centre for ACES Department of Mechanical Engineering National University of Singapore 119260 Singapore

The use of computational-intelligence-based techniques in the optimization of agent initial positions in land combat simulations is studied. A novel method for the reduction of support vectors in the support vector machine (SVM) is presented. The optimization on the width of the Gaussian kernel function and the combination of the SVM with the radial basis function neural network are performed in the proposed method. Simulation results show that the proposed method can improve the running efficiency drastically compared with that using the traditional SVM with the same precision. We also summarize and present some experiences and trends in the study on the optimization problem in land combat simulation.

关键词： multi-agent support vector machine radial basis function genetic algorithm regression

来源：评论

学校读者我要写书评

暂无评论

A modified integer-coding genetic algorithm for job shop scheduling problem

A modified integer-coding genetic algorithm for job shop sch...

引用

8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004

作者： Wu, Chunguo Xiang, Wei Liang, Yanchun Lee, Heow Pueh Zhou, Chunguang College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun130012 China Institute of High Performance Computing Singapore117528 Singapore

ISBN: (纸本)3540228179

An operation template is proposed in this paper for describing the mapping between operations and a subset of natural numbers. With such operation template, a job shop scheduling problem (JSSP) can be transformed into a traveling salesman problem (TSP), hence the integer-coding genetic algorithm for TSP can be easily applied and modified. A decoding strategy, called virtual job shop, is proposed to evaluate the fitness of the individual in GA population. The integration of the operation template and virtual job shop makes the existing integer-coding GA possible for solving an extension of a classical job shop scheduling problem. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A modified particle swarm optimization for combining forecasting

A modified particle swarm optimization for combining forecas...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： X.Y. Feng L.M. Wan Y.C. Liang Y.F. Sun H.P. Lee Y. Wang Kollege of Computer Science and Technology Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China The 8th Research Institute of Air Force Beijing China Institute of High Performance Computing Singapore Singapore

A modified particle swarm optimization (PSO) algorithm is proposed. Linear constraints in the PSO are added to satisfy the normalization conditions for different problems. A hybrid algorithm based on the modified PSO and combining forecasting is presented. Combining forecasting can improve the forecasting accuracy through combining different forecasting methods. The effectiveness of the algorithm is demonstrated through the prediction on the sunspots and the stocks data. Simulated results show that the hybrid algorithm can improve the forecasting accuracy to a great extent.

关键词： Particle swarm optimization Computational modeling Computer science Educational technology Laboratories Military computing knowledge engineering Computer science education High performance computing Predictive models

来源：评论

学校读者我要写书评

暂无评论

Smart home research

Smart home research

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

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

This paper is a survey for smart home research, from definition to current research status. First we give a definition to smart home, and then describe the smart home elements, typical research projects, smart home ne... 详细信息

ISBN: (纸本)0780384032

关键词： Smart homes Radio frequency Home appliances Home automation Protocols Artificial intelligence Intelligent control Manufacturing Power supplies Computerized monitoring

来源：评论

学校读者我要写书评

暂无评论

User-association mining based on two-stage count

User-association mining based on two-stage count

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Ya-Bo Liu Da-You Liu Hong Qi Fang-Ming Gu College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)0780384032

Both item-associations and user-associations mined from the rating table can be used to make personalized recommendation for the current user in rule-based recommend technique. Mining user-associations is the key for the recommendation based on user-associations. We find that the current user not only can be used to constrain the rule form in user-associations mining process, but also can be used to partition the rating table into two parts in order to accelerate user-associations mining. It is first proved that user-associations about the current user mined from the whole rating table are contained in those mined only from the data set that contain the current user's rating. Then, a user-association mining frame based on two-stage count called TSCF is proposed. TSCF frame can be implemented by using existing algorithms for mining association rules. And an algorithm TSCF-CL for mining user-associations is implemented by using the concept lattice. Last the performance comparison with ASARM algorithm shows that TSCF-CL can reach better time capacity.

关键词： Data mining Association rules Recommender systems Lattices Acceleration Filtering Computer science Educational technology Laboratories knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

A lifecycle-based parallel model of workflow management

A lifecycle-based parallel model of workflow management

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Wan-Jun Yu Da-You Liu Bo Yang Quan Liu College of Computer Science & Technology JiLin University Changchun China Key Laboratory of Symbolic Computation & Knowledge Engineering Ministry of Education Changchun China

ISBN: (纸本)0780384032

Workflow management systems (WFMSs) are used to coordinate and streamline business processes. Very large process instances are often running for a long period and the feedback iteration occurs frequently, thus the system is inefficient. To overcome such problems, we studied the issues that process modeling parallelly based on product lifecycle management and proposed a parallel model (LBPYYM: lifecycle-based parallel workflow model). First, the parallel process can be created with the model within a product lifecycle. Meanwhile, the complexity of process definition is reduced also by the parallel model. Second, the adhoc access control policies can be created in each phase of lifecycle to satisfy the access control requirement of the least privilege. Finally, two algorithms, which consist of 2-level role parse algorithm and 3-level role parse algorithm, are introduced. Through these two algorithms the workflow activities' participant can be defined very easily and flexibly.

关键词： engineering management Access control knowledge management Technology management Educational institutions Computer science Educational technology Laboratories knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：