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.     

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.     

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.     

Risk-sensitive control of Markov jump linear systems: Caveats and difficulties

In this technical note, we revisit the risk-sensitive optimal control problem for Markov jump linear systems (MJLSs). We first demonstrate the inherent difficulty in solving the risk-sensitive optimal control problem even if the system is linear and the cost function is quadratic. This is due to the nonlinear nature of the coupled set of Hamilton-Jacobi-Bellman (HJB) equations, stemming from the presence of the jump process. It thus follows that the standard quadratic form of the value function with a set of coupled Riccati differential equations cannot be a candidate solution to the coupled HJB equations. We subsequently show that there is no equivalence relationship between the problems of risk-sensitive control and H ^∞ control of MJLSs, which are shown to be equivalent in the absence of any jumps. Finally, we show that there does not exist a large deviation limit as well as a risk-neutral limit of the risk-sensitive optimal control problem due to the presence of a nonlinear coupling term in the HJB equations.

     

Linear-Time Recognition of Helly Circular-Arc Models and Graphs

A circular-arc model ℳ is a circle C together with a collection A\mathcal{A} of arcs of C. If A\mathcal{A} satisfies the Helly Property then ℳ is a Helly circular-arc model. A (Helly) circular-arc graph is the intersection graph of a (Helly) circular-arc model. Circular-arc graphs and their subclasses have been the object of a great deal of attention in the literature. Linear-time recognition algorithms have been described both for the general class and for some of its subclasses. However, for Helly circular-arc graphs, the best recognition algorithm is that by Gavril, whose complexity is O(n ³). In this article, we describe different characterizations for Helly circular-arc graphs, including a characterization by forbidden induced subgraphs for the class. The characterizations lead to a linear-time recognition algorithm for recognizing graphs of this class. The algorithm also produces certificates for a negative answer, by exhibiting a forbidden subgraph of it, within this same bound.     

Maximum Likelihood Sound Source Localization and Beamforming for Directional Microphone Arrays in Distributed Meetings

In distributed meeting applications, microphone arrays have been widely used to capture superior speech sound and perform speaker localization through sound source localization (SSL) and beamforming. This paper presents a unified maximum likelihood framework of these two techniques, and demonstrates how such a framework can be adapted to create efficient SSL and beamforming algorithms for reverberant rooms and unknown directional patterns of microphones. The proposed method is closely related to steered response power-based algorithms, which are known to work extremely well in real-world environments. We demonstrate the effectiveness of the proposed method on challenging synthetic and real-world datasets, including over six hours of recorded meetings.     

Decoupled approach to integrated optimum design of structures and robust control systems

Integrated optimum design of structures and control systems is studied by using H ₂ and robust control formulations. It is derived that conventional simultaneous optimization approach by using these robust control laws can be approximated by a decoupled optimization approach in which the structures are optimized by shaping the structural singular values and then the controllers can be designed, namely, decoupled, sequential or successive design approach. It is shown that the proposed decoupled optimization approach can be used to design optimum robust structures and has certain advantages over the conventional simultaneous optimization procedures such as it avoids the drawbacks of pure robust control laws and faster, especially if the number of degrees of freedom (DOF) of the associated structure is large. The bounds for achievable robustness measures are also obtained. Following, simultaneous and decoupled optimization approaches are applied to active control of two structures. The optimization results are presented, and it is concluded that the proposed decoupled optimization approach yields the achieved global minimum much faster than the simultaneous optimization approach.     

Log-based mining techniques applied to Web service composition reengineering

Web service compositions are becoming more and more complex, involving numerous interacting ad-hoc services. These services are often implemented as business processes themselves. By analysing such complex web service compositions one is able to better understand, control and eventually re-design them. Our contribution to this problem is a mining algorithm, based on a statistical technique to discover composite web service patterns from execution logs. Our approach is characterised by a “local” pattern’s discovery that covers partial results through a dynamic programming algorithm. Those locally discovered patterns are then composed iteratively until the composite Web service is discovered. The analysis of the disparities between the discovered model and the initial ad-hoc composite model (delta-analysis) enables initial design gaps to be detected and thus to re-engineer the initial Web service composition.     

A new supervised classification algorithm in artificial immune systems with its application to carotid artery Doppler signals to diagnose atherosclerosis

Because of its self-regulating nature, immune system has been an inspiration source for usually unsupervised learning methods in classification applications of Artificial Immune Systems (AIS). But classification with supervision can bring some advantages to AIS like other classification systems. Indeed, there have been some studies, which have obtained reasonable results and include supervision in this branch of AIS. In this study, we have proposed a new supervised AIS named as Supervised Affinity Maturation Algorithm (SAMA) and have presented its performance results through applying it to diagnose atherosclerosis using carotid artery Doppler signals as a real-world medical classification problem. We have employed the maximum envelope of the carotid artery Doppler sonograms derived from Autoregressive (AR) method as an input of proposed classification system and reached a maximum average classification accuracy of 98.93% with 10-fold cross-validation method used in training-test portioning. To evaluate this result, comparison was done with Artificial Neural Networks and Decision Trees. Our system was found to be comparable with those systems, which are used effectively in literature with respect to classification accuracy and classification time. Effects of system's parameters were also analyzed in performance evaluation applications. With this study and other possible contributions to AIS, classification algorithms with effective performances can be developed and potential of AIS in classification can be further revealed.