Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems

In recent years, one of the most important and promising research fields has been metaheuristics to find optimal or near-optimal solutions for NP-hard combinatorial optimization problems. Improving the quality of the solution or the solution time is basic research area on metaheuristics. Modifications of the existing ones or creation of hybrid approaches are the focus of these efforts. Another area of improving the solution quality of metaheuristics is finding the optimal combination of algorithm control parameters. This is usually done by design of experiments or one-at-a-time approach in genetic algorithms, simulated annealing and similar metaheuristics. We observe that, in studies which use Ant Colonies Optimization (ACO) as an optimization technique; the levels of control parameters are determined by some non-systematic initial experiments and the interactions of the parameters are not studied yet.In this study, the parameters of Ant System have been investigated on different sized and randomly generated job-shop scheduling problems by using design of experiments. The effects and interactions of the parameters have been interpreted with the outputs of the experiments. Referring to the statistical analysis it is observed that none of the interactions between the Ant System parameters has a significant effect on makespan value. A specific fractional experimental design is suggested instead of the full factorial design. Depending on the findings from the benchmark problems it will be a reliable approach to use the suggested design for saving time and effort in experiments without sacrificing the solution quality.     

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 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.     

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.     

Mobile multi-view object image search

High user interaction capability of mobile devices can help improve the accuracy of mobile visual search systems. At query time, it is possible to capture multiple views of an object from different viewing angles and at different scales with the mobile device camera to obtain richer information about the object compared to a single view and hence return more accurate results. Motivated by this, we propose a new multi-view visual query model on multi-view object image databases for mobile visual search. Multi-view images of objects acquired by the mobile clients are processed and local features are sent to a server, which combines the query image representations with early/late fusion methods and returns the query results. We performed a comprehensive analysis of early and late fusion approaches using various similarity functions, on an existing single view and a new multi-view object image database. The experimental results show that multi-view search provides significantly better retrieval accuracy compared to traditional single view search.     

Evaluation of a university website’s usability for visually impaired students

Today websites are the tools most commonly used to access information. People with disabilities face difficulties accessing or using information, and the importance of website usability in their lives needs to be recognized. Visually impaired students need to be able to use university websites that inform them about the opportunities and events taking place on campus. This study aims to evaluate the usability of a university website by visually impaired students. In this research, six visually impaired students were interviewed. The assistive technologies they use, as well as the various web pages they wished to use unaided were identified. Following data collection, usability tests were conducted and satisfaction surveys were completed. The usability test was done with five visually impaired students. They were asked to think aloud while performing 11 tasks involving their university’s web pages, including the main page and the pages of student affairs, library and departments and then to accomplish these tasks. In this test, five tasks were not successfully completed by all students. According to the test results, finding final exam dates on the academic calendar posed major difficulties, and accessing the course schedule web page was the task that required the most time. The test results indicated the need for a search engine on each page, a text version for all pages, rearrangement of the web link sequences with tabs and more information about visuals. Suggestions related to the visually impaired students’ needs were offered.     

Detection of colorectal adenoma and cancer based on transthyretin and C3a-desArg serum levels

Colorectal cancer is the second leading cause of cancer death, and it develops from benign colorectal adenomas in over 95% of patients. Early detection of these cancer precursors by screening tests and their removal can potentially eradicate more than 95% of colorectal cancers before they develop. To discover sensitive and specific biomarkers for improvement of pre‐clinical diagnosis of colorectal adenoma and cancer, we analysed in two independent studies (n = 87 and n = 83 patients) serum samples from colorectal cancer (stage III), colorectal adenoma and control patients using SELDI‐TOF‐MS. Extensive statistical analysis was performed to establish homogeneous patient groups based on their clinical data. Two biomarkers that were each able to distinguish control patients from either colorectal adenoma or colorectal cancer patients (p<0.001) were identified as transthyretin (pre‐albumin) and C3a‐desArg by MS/MS and were further validated by antibody‐based assays (radial immunodiffusion, ELISA). A combination of both proteins clearly indicated the presence of colorectal adenoma or carcinoma. Using a cut‐off of <0.225 g/L for transthyretin and >1974 ng/mL for C3a‐desArg, we found a sensitivity and specificity for colorectal adenoma of 96% and 70%, respectively.