Evolutionary Decomposition of Complex Design Spaces

This dissertation investigates the support of conceptual engineering design through the decomposition of multi-dimensional search spaces into regions of high performance. Such decomposition helps the designer identify optimal design directions by the elimination of infeasible or undesirable regions within the search space. Moreover, high levels of interaction between the designer and the model increases overall domain knowledge and significantly reduces uncertainty relating to the design task at hand. The aim of the research is to develop the archetypal Cluster Oriented Genetic Algorithm (COGA) which achieves search space decomposition by using variable mutation (vmCOGA) to promote diverse search and an Adaptive Filter (AF) to extract solutions of high performance [Parmee 1996a, 1996b]. Since COGAs are primarily used to decompose design domains of unknown nature within a real-time environment, the elimination of apriori knowledge, speed and robustness are paramount. Furthermore COGA should promote the in-depth exploration of the entire search space, sampling all optima and the surrounding areas. Finally any proposed system should allow for trouble free integration within a Graphical User Interface environment. The replacement of the variable mutation strategy with a number of algorithms which increase search space sampling are investigated. Utility is then increased by incorporating a control mechanism that maintains optimal performance by adapting each algorithm throughout search by means of a feedback measure based upon population convergence. Robustness is greatly improved by modifying the Adaptive Filter through the introduction of a process that ensures more accurate modelling of the evolving population. The performance of each prospective algorithm is assessed upon a suite of two-dimensional test functions using a set of novel performance metrics. A six dimensional test function is also developed where the areas of high performance are explicitly known, thus allowing for evaluation under conditions of increased dimensionality. Further complexity is introduced by two real world models described by both continuous and discrete parameters. These relate to the design of conceptual airframes and cooling hole geometries within a gas turbine. Results are promising and indicate significant improvement over the vmCOGA in terms of all desired criteria. This further supports the utilisation of COGA as a decision support tool during the conceptual phase of design.British Aerospace plc, Warton and Rolls Royce plc, Filto

Development and evaluation of low cost 2-d lidar based traffic data collection methods

Traffic data collection is one of the essential components of a transportation planning exercise. Granular traffic data such as volume count, vehicle classification, speed measurement, and occupancy, allows managing transportation systems more effectively. For effective traffic operation and management, authorities require deploying many sensors across the network. Moreover, the ascending efforts to achieve smart transportation aspects put immense pressure on planning authorities to deploy more sensors to cover an extensive network. This research focuses on the development and evaluation of inexpensive data collection methodology by using two-dimensional (2-D) Light Detection and Ranging (LiDAR) technology. LiDAR is adopted since it is economical and easily accessible technology. Moreover, its 360-degree visibility and accurate distance information make it more reliable. To collect traffic count data, the proposed method integrates a Continuous Wavelet Transform (CWT), and Support Vector Machine (SVM) into a single framework. Proof-of-Concept (POC) test is conducted in three different places in Newark, New Jersey to examine the performance of the proposed method. The POC test results demonstrate that the proposed method achieves acceptable performances, resulting in 83% ~ 94% accuracy. It is discovered that the proposed method\u27s accuracy is affected by the color of the exterior surface of a vehicle since some colored surfaces do not produce enough reflective rays. It is noticed that the blue and black colors are less reflective, while white-colored surfaces produce high reflective rays. A methodology is proposed that comprises K-means clustering, inverse sensor model, and Kalman filter to obtain trajectories of the vehicles at the intersections. The primary purpose of vehicle detection and tracking is to obtain the turning movement counts at an intersection. A K-means clustering is an unsupervised machine learning technique that clusters the data into different groups by analyzing the smallest mean of a data point from the centroid. The ultimate objective of applying K-mean clustering is to identify the difference between pedestrians and vehicles. An inverse sensor model is a state model of occupancy grid mapping that localizes the detected vehicles on the grid map. A constant velocity model based Kalman filter is defined to track the trajectory of the vehicles. The data are collected from two intersections located in Newark, New Jersey, to study the accuracy of the proposed method. The results show that the proposed method has an average accuracy of 83.75%. Furthermore, the obtained R-squared value for localization of the vehicles on the grid map is ranging between 0.87 to 0.89. Furthermore, a primary cost comparison is made to study the cost efficiency of the developed methodology. The cost comparison shows that the proposed methodology based on 2-D LiDAR technology can achieve acceptable accuracy at a low price and be considered a smart city concept to conduct extensive scale data collection

Adaptive and Concurrent Garbage Collection for Virtual Machines

An important issue for concurrent garbage collection in virtual machines (VM) is to identify which garbage collector (GC) to use during the collection process. For instance, Java program execution times differ greatly based on the employed GC. It has not been possible to identify the optimal GC algorithms for a specific program before exhaustively profiling the execution times for all available GC algorithms. In this paper, we present an adaptive and concurrent garbage collection (ACGC) technique that can predict the optimal GC algorithm for a program without going through all the GC algorithms. We implement this technique in the Java virtual machine and test it using standard benchmark suites. ACGC learns the algorithms’ usage pattern from different training program features and generates a model for future programs. Feature generation and selection are two important steps of our technique, which creates different attributes to use in the learning step. Our experimental evaluation shows improvement in selecting the best GC. Additionally, our approach is helpful in finding better heap size settings for improved program execution