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

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Hong Zheng Li-Ming Wan Jing-Qing Jiang Yan-Chun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China College of Computer Science and Engineering Changchun University of Technology Changchun China Institute of General Development and Evaluation of Equipment EAAF of PLA Beijing China College of Mathematics and Computer Science Inner Mongolia University for the Nationalities Tongliao China

A method for simultaneous analysis of the two components of compound paracetamol and diphenhydramine hydrochloride powdered drugs on near-infrared (NIR) spectroscopy is developed by using a radial basis function (RBF) network. Nearest neighbor-clustering algorithm is used as the learning algorithm of RBF network. Comparisons of the results obtained from the RBF models with those from BP models show that it is feasible to use the RBF network in nondestructive quantitative analysis of the components of drugs.

关键词： Powders Radial basis function networks Clustering algorithms Educational institutions Computer science Drugs Spectroscopy Educational technology knowledge engineering Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal partition algorithm of RBF neural network and its applications to stock price prediction

引用

Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence 2005年第3期18卷 374-379页

作者： Sun, Yan-Feng Liang, Yan-Chun Zhang, Wen-Li Lu, Ying-Hua Key Laboratory for Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Department of Computer Science Northeast Normal University Changchun 130024 China

The optimal partition algorithm (OPA) is applied to the training of parameters in the radial basis function (RBF) neural network. The appropriate modification for the OPA is performed according to the characteristics of the RBF neural network. The approach for determining the centers and widths of the clustering is added in the modified OPA and applied to choose the centers and widths of the neural network. A method for adjusting the structure of the neural network dynamically is presented by using the difference of the objective functions of the clustering. Thus it is realized to select the number of the hidden nodes adaptively. Simulation results of the stock price prediction demonstrate the effectiveness of the proposed approach. Comparisons with traditional algorithms show that the proposed OPA method possesses obvious advantages in the precision of forecasting, generalization, and forecasting trends. Simulations also show that the algorithm combining the OPA with the orthogonal least squares (OLS) possesses more superior performance in the rightness of forecasting trends.

关键词： Optimal partition algorithm (OPA) Ordered sample Radial basis function (RBF) neural network Stock price prediction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Spatial query preprocessing in distributed GIS

引用

3rd International Conference on Grid and Cooperative Computing, GCC2004

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

ISBN: (纸本)3540235647

This paper focuses on spatial query optimization in distributed GIS. A new qualitative spatial relation model and its consistency problem solution which compose topology, direction, distance and size are proposed. Research integrating the four aspects has not appeared before. A new method to deduce the constraints of spatial query is given, thus saves the query process time in distributed GIS. Finally, The methods and theories are applied to a distributed GIS project, the experiment result is satisfactory. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A hybrid constraint propagation mechanism for resource-constrained scheduling

A hybrid constraint propagation mechanism for resource-const...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Ju-Yang Zhang Ji-Gui Sun College of Computer Science & Technology Jilin University Changchun China Key Laboratory for Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

ISBN: (纸本)0780384032

Handling resource constraints in resource-constrained scheduling is always a NP-hard problem. In the beginning of this paper, the overview of the approaches to managing resource constraints and the deficiency of them are shown. Then a hybrid mechanism based on CBA rules and resource energy forward checking is proposed. By applying this mechanism, the generality and the efficiency of our system are heightened.

关键词： Job shop scheduling Resource management Processor scheduling Programming profession Sun Educational institutions Computer science Educational technology Laboratories knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：