Automatic inspection of metallic surface defects using genetic algorithms

This paper is concerned with the problem of automatic inspection of metallic surface using machine vision. An experimental system has been developed to take images of external metallic surfaces and an intelligent approach based on morphology and genetic algorithms is proposed to detect structural defects on bumpy metallic surfaces. The approach employs genetic algorithms to automatically learn morphology processing parameters such as structuring elements and defect segmentation threshold. This paper describes the detailed procedures which include encoding scheme, genetic operation and evaluation function.

The proposed method has been implemented and tested on a number of metallic surfaces. The results suggest that the method can provide an accurate identification to the defects and can be developed into a viable commercial visual inspection system.

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

This paper considers the Cardinality Constrained Quadratic Knapsack Problem (QKP) and the Quadratic Selective Travelling Salesman Problem (QSTSP). The QKP is a generalization of the Knapsack Problem and the QSTSP is a generalization of the Travelling Salesman Problem. Thus, both problems are NP hard. The QSTSP and the QKP can be solved using branch-and-cut methods. Good bounds can be obtained if strong constraints are used. Hence it is important to identify strong or even facet-defining constraints. This paper studies the polyhedral combinatorics of the QSTSP and the QKP, i.e. amongst others we identify facet-defining constraints for the QSTSP and the QKP, and provide mathematical proofs that they do indeed define facets.

Novel data management algorithms in peer-to-peer content distribution networks

The peer-to-peer content distribution network (PCDN) is a hot topic recently, and it has a huge potential for massive data intensive applications on the Internet. One of the challenges in PCDN is routing for data sources and data deliveries. In this paper, we studied a type of network model which is formed by dynamic autonomy area, structured source servers and proxy servers. Based on this network model, we proposed a number of algorithms to address the routing and data delivery issues. According to the highly dynamics of the autonomy area, we established dynamic tree structure proliferation system routing, proxy routing and resource searching algorithms. The simulations results showed that the performance of the proposed network model and the algorithms are stable.

A resource-search and routing algorithm within PCDN autonomy area

This paper studied a new type of network model; it is formed by the dynamic autonomy area, the structured source servers and the proxy servers. The new network model satisfies the dynamics within the autonomy area, where each node undertakes different tasks according to their different abilities, to ensure that each node has the load ability fit its own; it does not need to exchange information via the central servers, so it can carry out the efficient data transmission and routing search. According to the highly dynamics of the autonomy area, we established dynamic tree structure-proliferation system routing and resource-search algorithms and simulated these algorithms. Test results show the performance of the proposed network model and the algorithms are very stable.

On the geometry of localization, tracking and navigation

The thesis characterizes the geometry of certain localization, tracking and navigation problems. For instance, the potential localization performance of certain multi-sensor systems is measurably linked to the relative sensor-target geometry. Additionally, several optimal and robust algorithms for localization and tracking are designed which exploit the underlying geometry of the problem considered.

Habitat suitability for marine fishes using presence-only modelling and multibeam sonar

Improved access to multibeam sonar and underwater video technology is enabling scientists to use spatially-explicit, predictive modelling to improve our understanding of marine ecosystems. With the growing number of modelling approaches available, knowledge of the relative performance of different models in the marine environment is required. Habitat suitability of 5 demersal fish taxa in Discovery Bay, south-east Australia, were modelled using 10 presence-only algorithms: BIOCLIM, DOMAIN, ENFA (distance geometric mean [GM], distance harmonic mean [HM], median [M], area-adjusted median [Ma], median + extremum [Me], area-adjusted median + extremum [Mae] and minimum distance [Min]), and MAXENT. Model performance was assessed using kappa and area under curve (AUC) of the receiver operator characteristic. The influence of spatial range (area of occupancy) and environmental niches (marginality and tolerance) on modelling performance were also tested. MAXENT generally performed best, followed by ENFA-GM and -HM, DOMAIN, BIOCLIM, ENFA-M, -Min, -Ma, -Mae and -Me algorithms. Fish with clearly definable niches (i.e. high marginality) were most accurately modelled. Generally, Euclidean distance to nearest reef, HSI-b (backscatter), rugosity and maximum curvature were the most important variables in determining suitable habitat for the 5 demersal fish taxa investigated. This comparative study encourages ongoing use of presence-only approaches, particularly MAXENT, in modelling suitable habitat for demersal marine fishes.

Energy-efficient management of data center resources for cloud computing : a vision, architectural elements, and open challenges

Cloud computing is offering utility-oriented IT services to users worldwide. Based on a pay-as-you-go model, it enables hosting of pervasive applications from consumer, scientific, and business domains. However, data centers hosting Cloud applications consume huge amounts of energy, contributing to high operational costs and carbon footprints to the environment. Therefore, we need Green Cloud computing solutions that can not only save energy for the environment but also reduce operational costs. This paper presents vision, challenges, and architectural elements for energy-efficient management of Cloud computing environments. We focus on the development of dynamic resource provisioning and allocation algorithms that consider the synergy between various data center infrastructures (i.e., the hardware, power units, cooling and software), and holistically work to boost data center energy efficiency and performance. In particular, this paper proposes (a) architectural principles for energy-efficient management of Clouds; (b) energy-efficient resource allocation policies and scheduling algorithms considering quality-of-service expectations, and devices power usage characteristics; and (c) a novel software technology for energy-efficient management of Clouds. We have validated our approach by conducting a set of rigorous performance evaluation study using the CloudSim toolkit. The results demonstrate that Cloud computing model has immense potential as it offers significant performance gains as regards to response time and cost saving under dynamic workload scenarios.

An improved Gbest guided artificial bee colony (IGGABC) algorithm for classification and prediction tasks

Artificial Neural Networks (ANN) performance depends on network topology, activation function, behaviors of data, suitable synapse's values and learning algorithms. Many existing works used different learning algorithms to train ANN for getting high performance. Artificial Bee Colony (ABC) algorithm is one of the latest successfully Swarm Intelligence based technique for training Multilayer Perceptron (MLP). Normally Gbest Guided Artificial Bee Colony (GGABC) algorithm has strong exploitation process for solving mathematical problems, however the poor exploration creates problems like slow convergence and trapping in local minima. In this paper, the Improved Gbest Guided Artificial Bee Colony (IGGABC) algorithm is proposed for finding global optima. The proposed IGGABC algorithm has strong exploitation and exploration processes. The experimental results show that IGGABC algorithm performs better than that standard GGABC, BP and ABC algorithms for Boolean data classification and time-series prediction tasks.

New variable step-sizes minimizing mean-square deviation for the lms-type algorithms

The least-mean-square-type (LMS-type) algorithms are known as simple and effective adaptation algorithms. However, the LMS-type algorithms have a trade-off between the convergence rate and steady-state performance. In this paper, we investigate a new variable step-size approach to achieve fast convergence rate and low steady-state misadjustment. By approximating the optimal step-size that minimizes the mean-square deviation, we derive variable step-sizes for both the time-domain normalized LMS (NLMS) algorithm and the transform-domain LMS (TDLMS) algorithm. The proposed variable step-sizes are simple quotient forms of the filtered versions of the quadratic error and very effective for the NLMS and TDLMS algorithms. The computer simulations are demonstrated in the framework of adaptive system modeling. Superior performance is obtained compared to the existing popular variable step-size approaches of the NLMS and TDLMS algorithms. © 2014 Springer Science+Business Media New York.

Sodium ion dynamics in a sulfonate based ionomer system studied by 23Na solid-state nuclear magnetic resonance and impedance spectroscopy

A poly(2-acrylamido-2-methyl-1-propane-sulphonate) (PAMPS) ionomer containing both sodium and quaternary ammonium cations functionalised with an ether group, has been characterised in terms of its thermal properties, ionic conductivity and sodium ion dynamics. The ether oxygen was incorporated to reduce the Na+ association with the anionic sulfonate groups tethered to the polymer backbone, thereby promoting ion dissociation and ultimately enhancing the ionic conductivity. This functionalised ammonium cation led to a significant reduction in the ionomer Tg compared to an analogue system without an ether group, resulting in an increase in ionic conductivity of approximately four orders of magnitude. The sodium ion dynamics were probed by 23Na solid-state NMR, which allowed the signals from the dissociated (mobile) and bound Na+ cations to be distinguished. This demonstrates the utility of 23Na solid-state NMR as a probe of sodium dynamics in ionomer systems.

Local political subcultures and party activism in Italy: The case of the Democratic Party

While there are relevant studies on both local political subcultures and party activism in Italy, the literature misses the relations between these two social and political phenomena. This article aims at bridging the lacuna by presenting a typology of the local branches of the Italian PD (Democratic Party) based on the relationship between the features of party activism and the local political subcultures. Four types of local PD branch emerge: the ‘showcase’ branch, the ‘administrative’ branch, the ‘company’ branch and the ‘committee’ branch. The article discusses each type, while drawing on 40 in-depth interviews collected during field research. Insights into the relationship between local political subcultures and party activism in Italy are offered.

An adaptive information grid architecture for recommendation system

This paper presents an adaptive information grid architecture for recommendation systems, which consists of the features of the recommendation rule and a co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users to provide a lot of interactive communication. Furthermore, it supports other queries, such as keyword, URL and document investigations. When the structure is compared to other algorithms, the scalability is noticeably better. The high online performance can be obtained as well as the repository computation, which can achieve a high group-forming accuracy using only a fraction of web pages from a cluster.

Measuring the influence of fibre-to-fabric properties on the pilling of wool fabrics

This study ranks the contribution of various fibre, yarn and fabric attributes to the pilling of wool knitwear. On the basis of an artificial neural network modelling, a combination of sensitivity analysis, forwards/backwards search and genetic algorithms was used to identify the importance of various fibre/yarn/fabric input parameters. The three different techniques show broad similarities in their assessment of which input parameters are important or are not important in affecting fabric pilling. The ranking shows that fabric cover factor has the most effect on pilling, followed by yarn count and thin places, fibre length, yarn twist, etc. It is further illustrated that the directional trend of the predicted pilling outputs for a selection of inputs was in line with the expected behaviour. To verify the findings of input feature selection, input factors deemed to have a small effect on the predicted pilling output, such as fibre length and diameter variations and curvature, were removed and the subsequent performance statistically compared to the original multi-layer perceptron. Differences between the outputs predicted by the original and pruned models are found not to be statistically significant at the 5% significance level. Results from this study may help manufacturers and knitwear designers in choosing the most appropriate materials and structures to reduce the pilling propensity of wool knitwear.

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

The Asymmetric Travelling Salesman Problem with Replenishment Arcs (RATSP) is a new class of problems arising from work related to aircraft routing. Given a digraph with cost on the arcs, a solution of the RATSP, like that of the Asymmetric Travelling Salesman Problem, induces a directed tour in the graph which minimises total cost. However the tour must satisfy additional constraints: the arc set is partitioned into replenishment arcs and ordinary arcs, each node has a non-negative weight associated with it, and the tour cannot accumulate more than some weight limit before a replenishment arc must be used. To enforce this requirement, constraints are needed. We refer to these as replenishment constraints.

In this paper, we review previous polyhedral results for the RATSP and related problems, then prove that two classes of constraints developed in V. Mak and N. Boland [Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Technical Report TR M05/03, School of Information Technology, Deakin University, 2005] are, under appropriate conditions, facet-defining for the RATS polytope.

An agent-based hybrid intelligent system for financial investment planning

Many complex problems including financial investment planning require hybrid intelligent systems that integrate many intelligent techniques including expert systems, fuzzy logic, neural networks, and genetic algorithms. However, hybrid intelligent systems are difficult to develop due to complicated interactions and technique incompatibilities. This paper describes a hybrid intelligent system for financial investment planning that was built from agent points of view. This system currently consists of 13 different agents. The experimental results show that all agents in the system can work cooperatively to provide reasonable investment advice. The system is very flexible and robust. The success of the system indicates that agent technologies can significantly facilitate the construction of hybrid intelligent systems.