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

2017 Asia-Pacific Computer Science and Application Conference

作者： Zhao Xin Li Yu Liu Lianhui Zheng Jun Liu Yan He Xiangdong Shanghai Zhongqiao College Computer Center East China Normal University Network and Information Center Nanjing University

A Based-Similarity Combination SPL Test Suite Generation Method can be used to compute coverage,replace poor test cases and generate high coverage test *** the way to compute mutation and make test suite generation adapt to the current coverage from great mutation,the optimization procedure can be more ***,adaptive simulated annealing algorithm combined with simplified GA algorithm,which can ensure local optimization accuracy and take the whole situation into global searching space accordingly,is a good choice for combinatorial optimization *** with 6 feature model from SPLOT shows that the new test suite generation method can achieve smaller-size test suite with higher coverage.

关键词： SPL Feature Model Similarity Measurement Combination Test Suite Generation sa algorithm Mutation

来源：评论

学校读者我要写书评

暂无评论

A Combination Test Suite Generation Method Based on Adaptive Simulated Annealing Genetic algorithm for Software Product Line Testing

A Combination Test Suite Generation Method Based on Adaptive...

引用

第二届亚太计算机科学与应用学术会议

作者： Zhao Xin Li Yu Liu Lianhui Zheng Jun Liu Yan He Xiangdong Shanghai Zhongqiao College Computer Center East China Normal University Network and Information Center Nanjing University

A Based-Similarity Combination SPL Test Suite Generation Method can be used to compute coverage, replace poor test cases and generate high coverage test suite. Improve the way to compute mutation and make test suite generation adapt to the current coverage from great mutation, the optimization procedure can be more efficient. Meanwhile, adaptive simulated annealing algorithm combined with simplified GA algorithm, which can ensure local optimization accuracy and take the whole situation into global searching space accordingly, is a good choice for combinatorial optimization problems. Experiments with 6 feature model from SPLOT shows that the new test suite generation method can achieve smaller-size test suite with higher coverage.

关键词： SPL Feature Model Similarity Measurement Combination Test Suite Generation sa algorithm Mutation

来源：评论

学校读者我要写书评

暂无评论

Comparative research of optimization algorithms for parameters calibration of watershed hydrological model

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2016年第3期16卷 653-669页

作者： Huo, Jiuyuan Liu, Liqun Zhang, Yaonan Lanzhou Jiaotong Univ Sch Elect & Informat Engn Lanzhou 730070 Gansu Peoples R China Gansu Agr Univ Coll Informat Sci & Technol Lanzhou Gansu Peoples R China Chinese Acad Sci Cold & Arid Reg Environm & Engn Res Inst Lanzhou Gansu Peoples R China Gansu Data Engn & Technol Res Ctr Resources & Env Lanzhou Gansu Peoples R China

Parameter optimization and calibration of the hydrological model has been one of the important research fields in hydrological forecasting. This paper is written to address the inherent defects that traditional parameter optimization of Xinanjiang hydrological model with a single objective entails. These methods cannot fully exploit hydrological characteristics information from hydrological observation. We selected the Nash Sutcliffe coefficient, which is known to be biased for high flows and the logarithmic form of the Nash Sutcliffe coefficient that emphasize low-flow values as the objective functions. Then, we adopted the multi-objective optimization algorithms, such as the Nondominated Sorted Genetic algorithm-II (NSGAII) and the Third Evolution Step of Generalized Differential Evolution (GDE3), and the single-objective optimization algorithm, Simulated Annealing (sa). These algorithms were applied in Heihe River Basin to calibrate parameters of the Xinanjiang hydrological model for long-term prediction of river discharges. Through the evaluation of the Pareto optimal parameter set derived from multi-objective optimization algorithms and the optimal solution obtained from the single objective algorithm, the results showed that the multi-objective optimization algorithms, in particular the NSGA-II algorithm, perform best to locate the Pareto optimal solutions in the parameter search space. They can also obtain better results with respect to the model parameters calibrated by the single objective algorithm. The major contribution of this work is the comparative application research of single-objective optimization with the multi-objective optimization algorithms for the parameters optimization of the Xinanjiang model in the Heihe River basin.

关键词： Hydrological model parameter calibration multi-objective optimization algorithm Xinanjiang model NSGAII algorithm GDE3 algorithm sa algorithm

来源：评论

学校读者我要写书评

暂无评论

An artificial bee colony algorithm for design and optimize the fixed area layout problems

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2015年第9-12期78卷 2079-2095页

作者： saravanan, M. Arulkumar, P. V. Sri Subramanya Coll Engn & Technol Palani Tamil Nadu India Bharath Niketan Engn Coll Dept Mech Engn Aundipatty India

The placement of production equipments plays a major role in designing a layout in cellular manufacturing. The better placement increases the productivity. This article introduces a new algorithm to design and optimize a fixed area cellular layout problem by using an artificial bee colony (ABC) technique which is based on the intelligent foraging behavior of a honeybee. The objective of this article is to determine the physical arrangement of work centers by minimizing the total traveling distance of the product. Volume of the product and distance between the work centers are the important factors that affect layout design. Some relative importance factors like priority of products, hazardous moves, and back-tracking moves are considered in this article. Layout moment ratio helps to compare the different proposed layouts. The higher layout moment ratio is the more desirable layout. Also this article compares the results of ABC technique with genetic algorithm (GA) and simulated annealing (sa) algorithm based on the total moment value, layout moment ratio, number of iterations, computation time, and back-tracking movements. Finally, it concluded that ABC is a better technique to solve fixed area cellular layout problems than the mentioned algorithms with high dimensionality.

关键词： Cellular manufacturing ABC algorithm GA sa algorithm Relative importance factors

来源：评论

学校读者我要写书评

暂无评论

Solving Container Loading Problem With Simulated Annealing algorithm 15

Solving Container Loading Problem With Simulated Annealing A...

引用

15th IEEE International Symposium on Computational Intelligence and Informatics

作者： Can, Okan sahingoz, Ozgur Koray Turkish Air Force Acad Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9781479953370

In the economic world, transportation is very important and decreasing transportation cost is a challenging issue. To decrease this cost, increasing the efficiency of loading containers is very important, and this problem mainly named as Container Loading Problem(CLP). There are many researches about CLP with different type of approaches. In the literature, solutions are generally lined up as Heuristic and Meta-Heuristic approaches. Simulated annealing (sa) algorithm is a meta-heuristic approach. The most important advantage of sa is avoiding from local optimums. In this paper, a single CLP is solved by using simulated annealing algorithm. Proposed system algorithm and experimental results are presented. These results showed that sa is an acceptable solution approach for CLP type problems.

关键词： goods distribution loading simulated annealing transportation CLP sa algorithm container loading problem metaheuristic approach simulated annealing algorithm transportation cost Containers Heuristic algorithms Loading Organizations Simulated annealing Stability analysis Transportation

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic approach for constructing functional test-suites

引用

IET SOFTWARE 2013年第2期7卷 104-117页

作者： Avila-George, Himer Torres-Jimenez, Jose Gonzalez-Hernandez, Loreto Hernandez, Vicente Inst Tecnol Super Salvatierra Salvatierra Gto 48900 Mexico CINVESTAV TAMAULIPAS Informat Technol Lab Ciudad Victoria Tamps Mexico Univ Politecn Valencia CIEMAT Ctr Mixto CSIC Inst Instrumentac Imagen Mol I3M Valencia 46022 Spain

Today, software systems are complex and have many possible configurations. A deficient software testing process often leads to unfortunate consequences, including data losses, large economic losses, security breaches, and even bodily harm. Thus, the problem of performing effective and economical testing is a key issue. Combinatorial testing is a method that can reduce cost and increase the effectiveness of software testing for many applications. It is based on constructing economical sized test-suites that provide coverage of the most prevalent configurations. Mixed covering arrays (MCAs) are combinatorial structures that can be used to represent these test-suites. MCAs are combinatorial objects represented as matrices having a test case per row. MCAs are small, in comparison to an exhaustive approach, and guarantee a level of interaction coverage among the parameters involved. This study presents a metaheuristic approach based on a simulated annealing (sa) algorithm for constructing MCAs. This algorithm incorporates several distinguishing features, including an efficient heuristic to generate good quality initial solutions, and a compound neighbourhood function that combines two carefully designed neighbourhood functions. The experimental design involved a benchmark reported in the literature and two real cases of software components. The experimental evidence showed that the sa algorithm equals or improves the obtained results by other approaches reported in the literature, and also finds the optimal solution in some of the solved cases.

关键词： economics program testing simulated annealing software engineering metaheuristic approach functional test-suites software systems software testing economical testing combinatorial testing mixed covering arrays MCA combinatorial structures simulated annealing sa algorithm economics program testing simulated annealing software engineering metaheuristic approach functional test-suites software systems software testing economical testing combinatorial testing mixed covering arrays MCA combinatorial structures simulated annealing sa algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimized Implementation of Discrete Wavelet Transform with Area Efficiency

Optimized Implementation of Discrete Wavelet Transform with ...

引用

IEEE International Multi Conference on Automation, Computing, Control, Communication and Compressed Sensing (iMac4s)

作者： John, sani Jose, Manu Viswajyothi Coll Engn & Technol Vazhakkulam ECE Dept Muvattupuzha Kerala India

ISBN: (纸本)9781467350907;9781467350891

The objective of this paper is to illustrate a comparative study on the performance of DWT with the multiplier reducing algorithms. The optimization techniques were based on the identification of algorithms, which could exploit the FPGA features. Discrete Wavelet Transform (DWT) is one of the most used techniques for image compression and is applied in a large category of applications for multi resolution analysis of signals. DWT can provide significant compression ratios without great loss of visual quality than the previous techniques such as the Discrete Cosine Transform (DCT) and the Discrete Fourier Transform (DFT). This work provides an analysis between the conventional VLSI implementation techniques as against an area efficient realization approach. This is expected to provide a reduction in hardware complexity and also an increase in computational speed. The reduction in the resource utilization improves the system performance by means of reduction in power consumption as well as the reduction in delay.

关键词： DA algorithm DWT sa algorithm

来源：评论

学校读者我要写书评

暂无评论

Single-item lot-sizing and scheduling problem with deteriorating inventory and multiple warehouses

引用

SCIENTIA IRANICA 2013年第6期20卷 2177-2187页

作者： Vandani, M. Dolati, A. Bashiri, M. Shahed Univ Fac Engn Dept Ind Engn Tehran Iran Shahed Univ Dept Math & Comp Sci Tehran Iran

This paper introduces a Single-Item Lot-sizing and Scheduling Problem with Multiple Warehouses (SILSP-MW). In this problem, the inventory deteriorates over time, depending on the warehouse conditions, so multiple warehouses with different technologies are considered in this study. Each warehouse has a specified deterioration rate and holding cost. The purpose of the SILSP-MW is to determine production periods and quantities, and to select the appropriate warehouse to hold the inventory in each period, such that specified demand in each period is being satisfied while the total cost is minimized. We shall present a Mixed-Integer Linear Programming (MILP) formulation to model the problem. Moreover, a Simulated Annealing (sa) algorithm will be presented to solve this problem. We will evaluate the performance of the algorithm by computational experiments with small- and medium-sized examples. In addition, a full factorial design is developed to investigate the effect of the model parameters on the proposed sa algorithm. (C) 2013 Sharif University of Technology. All rights reserved.

关键词： Lot sizing Deteriorating inventory Multiple warehouses sa algorithm

来源：评论

学校读者我要写书评

暂无评论

Obtain the optimal of logistics delivery network with annealing algorithm

引用

Engineering Sciences 2013年第6期11卷 44-47页

作者： Duan Jingmin Chang Yuejun Li Zanxiang Cui Jianming Department of Architectural Engineering Sanmenxia Polytechnic Department of Bridge Engineering Southwest Jiaotong University Henan Construction Engineering Department Building School of Information Engineering Chang'an University

Simulated annealing(sa) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest,best,most economical,and so on. The paper uses an example of sa algorithm validation to verify it,and the method is proved to be feasible.

关键词： sa algorithm global optimum logistics and distribution network

来源：评论

学校读者我要写书评

暂无评论

Optimized Implementation of Discrete Wavelet Transform with Area Efficiency

Optimized Implementation of Discrete Wavelet Transform with ...

引用

International Multi-Conference on Automation, Computing, Communication, Control and Compressed Sensing

作者： sani John Manu Jose ECE Department Viswajyothi College of Engineering and Technology Vazhakkulam Muvattupuzha Kerala India

ISBN: (纸本)9781467350891

关键词： DA algorithm DWT sa algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：