A novel hybrid immune algorithm for global optimization in design and manufacturing

This paper presents a new hybrid optimization approach based on immune algorithm and hill climbing local search algorithm. The purpose of the present research is to develop a new optimization approach for solving design and manufacturing optimization problems. This research is the first application of immune algorithm to the optimization of machining parameters in the literature. In order to evaluate the proposed optimization approach, single objective test problem, multi-objective I-beam and machine-tool optimization problems taken from the literature are solved. Finally, the hybrid approach is applied to a case study for milling operations to show its effectiveness in machining operations. The results of the hybrid approach for the case study are compared with those of genetic algorithm, the feasible direction method and handbook recommendation.     

A new feature selection method on classification of medical datasets: Kernel F-score feature selection

In this paper, we have proposed a new feature selection method called kernel F-score feature selection (KFFS) used as pre-processing step in the classification of medical datasets. KFFS consists of two phases. In the first phase, input spaces (features) of medical datasets have been transformed to kernel space by means of Linear (Lin) or Radial Basis Function (RBF) kernel functions. By this way, the dimensions of medical datasets have increased to high dimension feature space. In the second phase, the F-score values of medical datasets with high dimensional feature space have been calculated using F-score formula. And then the mean value of calculated F-scores has been computed. If the F-score value of any feature in medical datasets is bigger than this mean value, that feature will be selected. Otherwise, that feature is removed from feature space. Thanks to KFFS method, the irrelevant or redundant features are removed from high dimensional input feature space. The cause of using kernel functions transforms from non-linearly separable medical dataset to a linearly separable feature space. In this study, we have used the heart disease dataset, SPECT (Single Photon Emission Computed Tomography) images dataset, and Escherichia coli Promoter Gene Sequence dataset taken from UCI (University California, Irvine) machine learning database to test the performance of KFFS method. As classification algorithms, Least Square Support Vector Machine (LS-SVM) and Levenberg–Marquardt Artificial Neural Network have been used. As shown in the obtained results, the proposed feature selection method called KFFS is produced very promising results compared to F-score feature selection.     

Medical application of information gain based artificial immune recognition system (AIRS): Diagnosis of thyroid disease

In this paper, we have made medical application of a new artificial immune system named the information gain based artificial immune recognition system (IG-AIRS) which minimizes the negative effects of taking into account all attributes in calculating Euclidean distance in shape–space representation which is used in many artificial immune systems. For medical data, thyroid disease data set was applied in the performance analysis of our proposed system. Our proposed system reached 95.90% classification accuracy with 10-fold CV method. This result ensured that IG-AIRS would be helpful in diagnosing thyroid function based on laboratory tests, and would open the way to various ill diagnoses support by using the recent clinical examination data, and we are actually in progress.     

A tool for multiobjective evolutionary algorithms

This paper introduces a software tool based on illustrative applications for the development, analysis and application of multiobjective evolutionary algorithms. The multiobjective evolutionary algorithms tool (MOEAT) written in C# using a variety of multiobjective evolutionary algorithms (MOEAs) offers a powerful environment for various kinds of optimization tasks. It has many useful features such as visualizing of the progress and the results of optimization in a dynamic or static mode, and decision variable settings. The performance measurements of well-known multiobjective evolutionary algorithms in MOEAT are done using benchmark problems. In addition, two case studies from engineering domain are presented.     

A neuro-genetic-simulated annealing approach to the inverse kinematics solution of robots: a simulation based study

In this study, a hybrid intelligent solution system including neural networks, genetic algorithms and simulated annealing has been proposed for the inverse kinematics solution of robotic manipulators. The main purpose of the proposed system is to decrease the end effector error of a neural network based inverse kinematics solution. In the designed hybrid intelligent system, simulated annealing algorithm has been used as a genetic operator to decrease the process time of the genetic algorithm to find the optimum solution. Obtained best solution from the neural network has been included in the initial solution of genetic algorithm with randomly produced solutions. The end effector error has been reduced micrometer levels after the implementation of the hybrid intelligent solution system.     

Multi‐level reranking approach for bug localization

Bug fixing has a key role in software quality evaluation. Bug fixing starts with the bug localization step, in which developers use textual bug information to find location of source codes which have the bug. Bug localization is a tedious and time consuming process. Information retrieval requires understanding the programme's goal, coding structure, programming logic and the relevant attributes of bug. Information retrieval (IR) based bug localization is a retrieval task, where bug reports and source files represent the queries and documents, respectively. In this paper, we propose BugCatcher, a newly developed bug localization method based on multi‐level re‐ranking IR technique. We evaluate BugCatcher on three open source projects with approximately 3400 bugs. Our experiments show that multi‐level reranking approach to bug localization is promising. Retrieval performance and accuracy of BugCatcher are better than current bug localization tools, and BugCatcher has the best Top N, Mean Average Precision (MAP) and Mean Reciprocal Rank (MRR) values for all datasets.     

Functional Diversity,Absorptive Capability and Product Success: The Moderating Role of Project Complexity in New Product Development Teams

Absorptive capability appears to be an appealing concept in the technology and innovation management literature. Though absorptive capability attracts researchers from a variety of disciplines, team‐level empirical research on it is scant. In this study, we operationalized team absorptive capability as a multidimensional construct involving knowledge acquisition, assimilation and exploitation. This study also explores the moderating effect of project complexity between team absorptive capability and new product success. In studying the data from 239 new product development projects using partial least squares structural equation modelling, we found that team functional diversity is a significant determinant of team absorptive capability. Moreover, regarding the relationships between team absorptive capability and new product success, we uncovered that (i) new product success is dependent on the ability to understand the acquired knowledge, and (ii) the teams appear to be more cautious in putting the assimilated knowledge into practice to the extent that project complexity increases.     

Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis

Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, that is, a linear optimization problem over the convex but computationally intractable cone of completely positive matrices. In this paper, we focus on general inner approximations of the cone of completely positive matrices on instances of completely positive optimization problems that arise from the reformulation of mixed binary quadratic programming problems. We provide a characterization of the feasibility of such an inner approximation as well as the optimal value of a feasible inner approximation. In particular, our results imply that polyhedral inner approximations are equivalent to a finite discretization of the feasible region of the original completely positive optimization problem. Our characterization yields, as a byproduct, an upper bound on the gap between the optimal value of an inner approximation and that of the original instance. We discuss the implications of this error bound for standard and box-constrained quadratic programs as well as general mixed binary quadratic programs with a bounded feasible region.