Search based software engineering: Trends, techniques and applications

© ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version is available from the link below.In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives. This article provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.EPSRC and E

Detecting healthy concrete surfaces

Teams of engineers visually inspect more than half a million bridges per year in the US and EU. There is clear evidence to suggest that they are not able to meet all bridge inspection guideline requirements due to a combination of the level of detail expected, the limited time available and the large area of bridge surfaces to be inspected. Methods have been proposed to address this problem through damage detection in visual data, yet the inspection load remains high. This paper proposes a method to tackle this problem by detecting (and disregarding) healthy concrete areas that comprise over 80-90% of the total area. The originality of this work lies in the method’s slicing and merging to enable the sequential processing of high resolution bridge surface textures with a state of the art classifier to distinguish between healthy and potentially unhealthy surface texture. Morphological operators are then used to generate an outline mask to highlight the classification results in the surface texture. The training and validation set consists of 1,028 images taken from multiple Department of Transportation bridge inspection databases and data collection from ten highway bridges around Cambridge. The presented method achieves a search space reduction for an inspector of 90.1% with a risk of missing a defect patch of 8.2%. This work is of great significance for bridge inspectors as they are now able to spend more time on assessing potentially unhealthy surface regions instead of searching for these needles in a mainly healthy concrete surface haystack.This work is partly funded by Trimble Inc. and by the European Union’s Seventh Framework Programme for research, technological development and demonstration under grant agreement no. 31109806.0007. SeeBridge is co-funded by Funding Partners of the ERA-NET Plus Infravation and the European Commission. The Funding Partners of the Infravation 2014 Call are: Ministerie van Infrastructuur en Milieu, Rijkswaterstaat, Bundesministerium für Verkehr, Bau und Stadtentwicklung, Danish Road Directorate, Statens Vegvesen Vegdirektoratet, Trafikverket – Trv, Vegagerðin, Ministere de L’ecologie, du Developpement Durable et de L’energie, Centro para el Desarrollo Tecnologico Industrial, Anas S.P.A., Netivei Israel – National Transport Infrastructure Company Ltd. and Federal Highway Administration USDOT

A Software Agent for Adaptive Navigation Support in a Restricted Internet Area

This thesis deals with the development of a software system that helps a user to search for information in the World Wide Web. The particular problem considered here is support in a well-defined, restricted Web area. Two support strategies are considered. One strategy is to present a visitor views of a local hyperlink structure depending on the current position in hyper-space and previous navigation decisions. Main partial problems to realize such a support are dealt with, like the registration of user behavior, the registration of information about the Web area and the presentation of support information on the client side. In contrast to similar systems, the developed system may be applied by a large fraction of Internet users instantly. The only requirement on the client side is Java support by the browser. The second considered support strategy is an estimation of the pertinence of data objects and sequences in the Web for a specific client. This estimation is based on the client's previous navigation behavior and registered navigation behavior of other users (collaborative filtering). The approach to estimate relevant data objects in this thesis is to predict a user's future data requests. For this purpose the presented system stores user information on theserver side. User behavior is modeled by graphs, consisting of nodes representing requested data objects and edges representing transitions. A new method is presented to predict future navigation steps that is based on a distribution estimation of registered graphs and a classification of a new (partial) navigation profile with regard to the estimated distribution. The different steps of the presented algorithm are evaluated using generated and observed profiles

Stochastic System Design and Applications to Stochastically Robust Structural Control

The knowledge about a planned system in engineering design applications is never complete. Often, a probabilistic quantification of the uncertainty arising from this missing information is warranted in order to efficiently incorporate our partial knowledge about the system and its environment into their respective models. In this framework, the design objective is typically related to the expected value of a system performance measure, such as reliability or expected life-cycle cost. This system design process is called stochastic system design and the associated design optimization problem stochastic optimization. In this thesis general stochastic system design problems are discussed. Application of this design approach to the specific field of structural control is considered for developing a robust-to-uncertainties nonlinear controller synthesis methodology. Initially problems that involve relatively simple models are discussed. Analytical approximations, motivated by the simplicity of the models adopted, are discussed for evaluating the system performance and efficiently performing the stochastic optimization. Special focus is given in this setting on the design of control laws for linear structural systems with probabilistic model uncertainty, under stationary stochastic excitation. The analysis then shifts to complex systems, involving nonlinear models with high-dimensional uncertainties. To address this complexity in the model description stochastic simulation is suggested for evaluating the performance objectives. This simulation-based approach addresses adequately all important characteristics of the system but makes the associated design optimization challenging. A novel algorithm, called Stochastic Subset Optimization (SSO), is developed for efficiently exploring the sensitivity of the objective function to the design variables and iteratively identifying a subset of the original design space that has v i high plausibility of containing the optimal design variables. An efficient two-stage framework for the stochastic optimization is then discussed combining SSO with some other stochastic search algorithm. Topics related to the combination of the two different stages for overall enhanced efficiency of the optimization process are discussed. Applications to general structural design problems as well as structural control problems are finally considered. The design objectives in these problems are the reliability of the system and the life-cycle cost. For the latter case, instead of approximating the damages from future earthquakes in terms of the reliability of the structure, as typically performed in past research efforts, an accurate methodology is presented for estimating this cost; this methodology uses the nonlinear response of the structure under a given excitation to estimate the damages in a detailed, component level

Detectando agrupamientos y contornos: un estudio doble sobre representación de formas

Las formas juegan un rol clave en nuestro sistema cognitivo: en la percepción de las formas yace el principio de la formación de conceptos. Siguiendo esta línea de pensamiento, la escuela de la Gestalt ha estudiado extensivamente la percep- ción de formas como el proceso de asir características estructurales encontradas o impuestas sobre el material de estímulo.En resumen, tenemos dos modelos de formas: pueden existir físicamente o ser un producto de nuestros procesos cogni- tivos. El primer grupo está compuesto por formas que pueden ser definidas extra- yendo los contornos de objetos sólidos. En este trabajo nos restringiremos al caso bidimensional. Decimos entonces que las formas del primer tipo son formas planares. Atacamos el problema de detectar y reconocer formas planares. Cier- tas restricciones teóricas y prácticas nos llevan a definir una forma planar como cualquier pedazo de línea de nivel de una imagen. Comenzamos por establecer que los métodos a contrario existentes para de- tectar líneas de nivel son usualmente muy restrictivos: una curva debe ser enter- amente saliente para ser detectada. Esto se encuentra en clara contradicción con la observación de que pedazos de líneas de nivel coinciden con los contornos de los objetos. Por lo tanto proponemos una modificación en la que el algoritmo de detección es relajado, permitiendo la detección de curvas parcialmente salientes. En un segundo acercamiento, estudiamos la interacción entre dos maneras diferentes de determinar la prominencia de una línea de nivel. Proponemos un esquema para competición de características donde el contraste y la regularidad compiten entre ellos, resultando en que solamente las líneas de nivel contrastadas y regulares son consderedas salientes. Una tercera contribución es un algoritmo de limpieza que analiza líneas de nivel salientes, descartando los pedazos no salientes y conservando los salientes. Está basado en un algoritmo para detección de multisegmentos que fue extendido para trabajar con entradas periódicas. Finalmente, proponemos un descriptor de formas para codificar las formas detectadas, basado en el Shape Context global. Cada línea de nivel es codificada usando shape contexts, generando así un nuevo descriptor semi-local. A contin- uación adaptamos un algoritmShape plays a key role in our cognitive system: in the perception of shape lies the beginning of concept formation. Following this lines of thought, the Gestalt school has extensively studied shape perception as the grasping of structural fea- tures found in or imposed upon the stimulus material. In summary, we have two models for shapes: they can exist physically or be a product of our cognitive pro- cesses. The first group is formed by shapes that can be defined by extracting contours from solid objects. In this work we will restrict ourselves to the two dimensional case. Therefore we say that these shapes of the first type are planar shapes. We ad- dress the problem of detecting and recognizing planar shapes. A few theoretical and practical restrictions lead us to define a planar shape as any piece of mean- ingful level line of an image. We begin by stating that previous a contrario methods to detect level lines are often too restrictive: a curve must be entirely salient to be detected. This is clearly in contradiction with the observation that pieces to level lines coincide with object boundaries. Therefore we propose a modification in which the detection criterion is relaxed by permitting the detection of partially salient level lines. As a second approach, we study the interaction between two different ways of determining level line saliency: contrast and regularity. We propose a scheme for feature competition where contrast and regularity contend with each other, resulting in that only contrasted and regular level lines are considered salient. A third contribution is a clean-up algorithm that analyses salient level lines, discarding the non-salient pieces and returning the salient ones. It is based on an algorithm for multisegment detection, which was extended to work with periodic inputs. Finally, we propose a shape descriptor to encode the detected shapes, based on the global Shape Context. Each level line is encoded using shape contexts, thus generating a new semi-local descriptor. We then adapt an existing a contrario shape matching algorithm to our particular case. The second group is composed by shapes that do not correspond to a solid object but are formed by integrating several solid objects. The simplest shapes in this group are arrangements of points in two dimensions. Clustering techniques might be helpful in these situations. In a seminal work from 1971, Zahn faced the problem of finding perceptual clusters according to the proximity gestalt and proposed three basic principles for clustering algorithms: (1) only inter-point distances matter, (2) stable results across executions and (3) independence from the exploration strategy. A last implicit requirement is crucial: clusters may have arbitrary shapes and detection algorithms must be capable of dealing with this. In this part we will focus on designing clustering methods that completely fulfils the aforementioned requirements and that impose minimal assumptions on the data to be clustered. We begin by assessing the problem of validating clusters in a hierarchical struc- ture. Based on nonparametric density estimation methods, we propose to com- pute the saliency of a given cluster. Then, it is possible to select the most salient clusters in the hierarchy. In practice, the method shows a preference toward com- pact clusters and we propose a simple heuristic to correct this issue. In general, graph-based hierarchical methods require to first compute the com- plete graph of interpoint distances. For this reason, hierarchical methods are often considered slow. The most usually used, and the fastest hierarchical clustering al- gorithm is based on the Minimum Spanning Tree (MST). We therefore propose an algorithm to compute the MST while avoiding the intermediate step of computing the complete set of interpoint distances. Moreover, the algorithm can be fully par- allelized with ease. The algorithm exhibits good performance for low-dimensional datasets and allows for an approximate but robust solution for higher dimensions. Finally we propose a method to select clustered subtrees from the MST, by computing simple edge statistics. The method allows naturally to retrieve clus- ters with arbitrary shapes. It also works well in noisy situations, where noise is regarded as unclustered data, allowing to separate it from clustered data. We also show that the iterative application of the algorithm allows to solve a phenomenon called masking, where highly populated clusters avoid the detection less popu- lated ones.Fil:Tepper, Mariano. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina