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

International Conference on Control and Automation (ICCA)

作者： Zehai Li Jigui Sun Haihong Yu Jian Zhang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

ETL tools are responsible for the extraction of data from sources, their cleansing and loading into a target data warehouse. However, nowadays, the design and development of ETL processes are performed in an in-house fashion, and need uniformed methodological foundations. In this paper, we propose a novel conceptual model for the modeling of ETL processes. We employ CommonCubes to represent the cubes in a target data warehouse. CommonCubes release the design of ETL processes from overdependence on the physical schema of the target data warehouse, and enable the designers to pay more efforts to data transforming than data loading when designing ETL processes. Based on the constraint functions on source attributes and the transforming operations on target attributes, we define ETL mappings 1:0 capture the semantics of various relationship cardinalities between source attributes and target attributes, which provide a good basis for the design of ETL processes.

关键词： Data warehouses Data mining Cleaning Computer science Process design Costs Educational technology Laboratories Knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

Medicine composition concentration analysis based on least square support vector machine

Medicine composition concentration analysis based on least s...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Xin-Chen Guo Zhou-Yi Chen Li-Rong Teng Chun-Guo Wu Tian-Bao Du Jia-Huilu Qing-Fan Meng Yan-Chun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China College of Science Northeast China Institute of Electric Power Engineering Jilin China EAAF of PLA Institute of General Development and Evaluation of Equipment Beijing China College of Life Science Jilin University Changchun China

This paper presents a method of medicine composition concentration analysis based on least square support vector machines (LS-SVMs) and examines the importance of the hyperparameter choice in improvement of algorithm performance. simulation results show that the proposed method obtains high quality precision in the generalization, compared with multiple linear regression, and that it is an efficient approach to regression estimation.

关键词： Least squares methods Support vector machines Educational institutions Performance analysis Algorithm design and analysis Knowledge engineering Linear regression Spectral analysis Quadratic programming Lagrangian functions

来源：评论

学校读者我要写书评

暂无评论

Realize utility-driven decision theoretic planning on the planning graph

Realize utility-driven decision theoretic planning on the pl...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： You-hong Zhang Ming-hao Yin Wen-xiang Gu Department of Information and Mathematics College of Science Foshan University Foshan China School of Computer Science Northeast Normal University Changchun Jilin China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

This paper presents a new model to incorporate decision theory into Graphplan framework, which enables our planner to handle uncertainty and make decision to choose the optimal one among a set of hypothesis valid plans. This planer, called UTDP is tested on several experimental domains. And the experimental results show that UTGP is sound and efficient and performs better than the famous probabilistic planner Buridan.

关键词： Uncertainty Decision theory Strips Mathematics Educational institutions Computer science Laboratories Computer science education Electronic mail Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Nondestructive quantitative analysis of compound paracetamol and diphenhydramine hydrochloride powder using RBF networks

Nondestructive quantitative analysis of compound paracetamol...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：