This thesis describes an electrochemical investigation of the processes occurring at the hydrogen evolving cathode during the industrial production of fluorine in molten KF–2HF. A 1A laboratory cell, designed for the purposes of the project, is described. Observations of the operation of this cell are reported. A comparison of a range of electrode materials is given, both with regard to electrochemical overvoltage and the bubbling releasing characteristics, for which photographic evidence is presented. In addition, measurements of the ohmic potential drop, caused by the presence of bubbles, were made for different bubble types. Included in the above is a description of any effects of metallic impurities present in the melt both on overvoltage and bubble release. A mechanistic study of hydrogen evolution on platinum is described and compared with the reaction at a mild steel electrode. A preliminary investigation into the use of parallel strand expanded metal electrodes was made and further photographic evidence presented.

Image segmentation is an important step in the image analysis process. Current image segmentation techniques, however, require that the user tune several parameters in order to obtain maximum segmentation accuracy, a computationally inefficient approach, especially when a large number of images must be processed sequentially in real time. Another major challenge, particularly with medical image analysis, is the discrepancy between objective measures for assessing and guiding the segmentation process, on the one hand, and the subjective perception of the end users (e.g., clinicians), on the other. Hence, the setting and adjustment of parameters for medical image segmentation should be performed in a manner that incorporates user feedback. Despite the substantial number of techniques proposed in recent years, accurate segmentation of digital images remains a challenging task for automated computer algorithms. Approaches based on machine learning hold particular promise in this regard because, in many applications, including medical image analysis, frequent user intervention can be assumed as a means of correcting the results, thereby generating valuable feedback for algorithmic learning. This thesis presents an investigation of the use of evolving fuzzy systems for designing a method that overcomes the problems associated with medical image segmentation. An evolving fuzzy system can be trained using a set of invariant features, along with their optimum parameters, which act as a target for the system. Evolving fuzzy systems are also capable of adjusting parameters based on online updates of their rule base. This thesis proposes three different approaches that employ an evolving fuzzy system for the continual adjustment of the parameters of any medical image segmentation technique. The first proposed approach is based on evolving fuzzy image segmentation (EFIS). EFIS can adjust the parameters of existing segmentation methods and switch between them or fuse their results. The evolving rules have been applied for breast ultrasound images, with EFIS being used to adjust the parameters of three segmentation methods: global thresholding, region growing, and statistical region merging. The results for ten independent experiments for each of the three methods show average increases in accuracy of 5\%, 12\% and 9\% respectively. A comparison of the EFIS results with those obtained using five other thresholding methods revealed improvements. On the other hand, EFIS has some weak points, such as some fixed parameters and an inefficient feature calculation process. The second approach proposed as a means of overcoming the problems with EFIS is a new version of EFIS, called self-configuring EFIS (SC-EFIS). SC-EFIS uses the available data to estimate all of the parameters that are fixed in EFIS and has a feature selection process that selects suitable features based on current data. SC-EFIS was evaluated using the same three methods as for EFIS. The results show that SC-EFIS is competitive with EFIS but provides a higher level of automation. In the third approach, SC-EFIS is used to dynamically adjust more than one parameter, for example, three parameters of the normalized cut (N-cut) segmentation technique. This method, called multi-parametric SC-EFIS (MSC-EFIS), was applied to magnetic resonance images (MRIs) of the bladder and to breast ultrasound images. The results show the ability of MSC-EFIS to adjust multiple parameters. For ten independent experiments for each of the bladder and the breast images, this approach produced average accuracies that are 8\% and 16\% higher respectively, compared with their default values. The experimental results indicate that the proposed algorithms show significant promise in enhancing image segmentation, especially for medical applications.

The chloroplast matK gene has been identified as a rapidly evolving gene at nucleotide and corresponding amino acid levels. The high number of nucleotide substitutions and length mutations in matK has provided a strong phylogenetic signal for resolving plant phylogenies at various taxonomic levels. However, these same features have raised questions as to whether matK produces a functional protein product. matK is the only proposed chloroplast-encoded group II intron maturase. There are 15 genes in the chloroplast that would require a maturase for RNA splicing. Six of these genes have introns that are not excised by a nuclear imported maturase, leaving MatK as the only candidate for processing introns in these genes. Very little research has been conducted concerning the expression and function of this important gene and its protein product. It has become crucial to understand matK expression in light of its significance in RNA processing and plant systematics. In this study, we examined the expression, function and evolution of MatK using a combination of molecular and genetic methods. Our findings indicate that matK RNA and protein is expressed in a variety of plant species, and expression of MatK protein is regulated by development. In addition, matK RNA levels are affected by light. Furthermore, genetic analysis has revealed that although MatK has a high rate of amino acid substitution, these substitutions are not random but are constrained to maintain overall chemical structure and stability in this protein. We have also identified an alternate start codon for matK in some plant species that buffers indels (insertions and deletions) in the open reading frame (ORF) that are not in multiples of three in the gene sequence. Usually, indels not in multiples of three result in frame shifts that destroy the reading frame. Our results indicate that an out-of-frame matK start codon in some orchids compensates for these otherwise deleterious indels. This research represents the first in-depth analysis of matK gene expression and contributes to several fields of biology including plant systematics, genetics and gene expression. / Ph. D.

No description available.

I study information dissemination and opinion formation in a framework of evolving social networks. Individuals take weighted averages repeatedly to update their opinions. They also update their assessments on others' opinions, represented by an influence weight matrix. It is proven that both opinions and the influence weights are convergent. In the steady state, consensus is reached where all individuals hold the same opinion. Convergence occurs with an extended model as well, which indicates the tremendous influential power possessed by a minority group. Then I impose a dual network structure, where individuals not only collect information, but also use the information to play a coordination game with a selected group of opponents that one is connected with. All individuals update their strategies based on a naive learning process within a separate influence network in which information is disseminated. The selection of opponents also gets updated over time. I calculate the critical values of costs associated with connections for different network structures and strategies to occur in the steady state. Finally, I investigate the outcomes of social learning under various exogenous network structures. Individuals use an algorithm that takes into account both proximity of opinions and impact of neighbors. Results also show consensus, with convergence speed correlated with the network structure. In addition, an endogenous network formation in two stages that utilizes network and distance between agents' opinions is proposed. The resulting networks show power-law patterns in degree distribution. / Ph. D.

Vehicular Ad hoc Networks (VANETs) are a particular form of wireless network made by vehicles communicating among themselves and with roadside base stations. A wide range of services has been developed for VANETs ranging from safety to infotainment applications. A key requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Furthermore, due to the openness of VANET’s wireless channels to both internal and external attacks, the application of security mechanisms is mandatory to protect the offered QoS guarantees. QoS routing plays an essential role in identifying routes that meet the QoS requirements of the offered service over VANETs. However, searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Moreover, routing reliability needs to be given special attention as communication links frequently break in VANETs. To date, most existing QoS routing algorithms are designed for stable networks without considering the security of the routing process. Therefore, they are not suitable for applications in VANETs. In this thesis, the above issues are addressed firstly by developing a link reliability model based on the topological and mathematical properties of vehicular movements and velocities. Evolving graph theory is then utilised to model the VANET communication graph and integrate the developed link reliability model into it. Based on the resulting extended evolving graph model, the most reliable route in the network is picked. Secondly, the situational awareness model is applied to the developed reliable routing process because picking the most reliable route does not guarantee reliable transmission. Therefore, a situation-aware reliable multipath routing algorithm for VANETs is proposed. Thirdly, the Ant Colony Optimisation (ACO) technique is employed to propose an Ant-based multi-constrained QoS (AMCQ) routing algorithm for VANETs. AMCQ is designed to give significant advantages to the implementation of security mechanisms that are intended to protect the QoS routing process. Finally, a novel set of security procedures is proposed to defend the routing process against external and internal threats. Simulation results demonstrate that high levels of QoS can be still guaranteed by AMCQ even when the security procedures are applied.

Information Systems (IS’s) have provided organisations with huge efficiency gains and benefits over the years; however an outstanding problem that is yet to be successfully tackled is that of the troublesome maintenance phase. Consuming vast resources and thwarting business progression in a competitive global market place, system maintenance has been recognised as one of the key areas where IS is failing organisations. Organisations are too often faced with the dilemma of either replacement or the continual upkeep of an unwieldy system. The ability for IS’s to be able to adapt to exogenous influences is even more acute today than at any time in the past. This is due to IS’s namely, Web Information Systems (WIS’s) increasingly and continually having to accommodate the needs of organisations to interconnect with a plethora of additional systems as well as supporting evolving business models. The richness of the interconnectivity, functionalities and services WIS’s now offer are shaping social, cultural and economic behaviour on a truly global scale, making the maintenance of such systems and evermore pertinent issue. The growth and proliferation of WIS’s shows no sign of abating which leads to the conclusion that what some have termed as the ‘maintenance iceberg’ should not be ignored. The quandary that commercial organisations face is typically driven by two key aspects; firstly, systems are built on the cultural premise of using fixed requirements, with not enough thought or attention being paid to systems abilities to deviate from these requirements. Secondly, systems do not generally cope well with adapting to unpredictable change arising from outside of the organisations environment. Over the recent past, different paradigms, approaches and methods have attempted to make software development more predictable, controllable and adaptable, however, the benefits of such measures in relation to the maintenance dilemma have been limited. The concept of flexible systems that are able to cope with such change in an efficient manner is currently an objective that few can claim to have realised successfully. The primary focus of the thesis was to examine WIS post-development change in order to empirically substantiate and understand the nature of the maintenance phase. This was done with the intention to determine exactly ‘where’ and ‘how’ flexibility could be targeted to address these changes. This study uses an emergent analytical approach to identify and catalogue the nature of change occurring within WIS maintenance. However, the research framework design underwent a significant revision as the initial results indicated that a greater emphasis and refocus was required to achieve the research objective. To study WIS’s in an appropriate and detailed context, a single case study was conducted in a web development software house. In total the case study approach was used to collect empirical evidence from four projects that investigated post-development change requests in order to identify areas of the system susceptible to change. The maintenance phases of three WIS projects were considered in-depth, resulting in the collection of over four hundred change requests. The fourth project served as a validation case. The results are presented and the findings are used to identify key trends and characteristics that depict WIS maintenance change. The analytical information derived from the change requests is consolidated and shown diagrammatically for the key areas of change using profile models developed in this thesis. Based on the results, the thesis concludes and contributes to the ongoing debate that there is a discernable difference when considering WIS maintenance change compared to that of traditional IS maintenance. The detailed characteristics displayed in the profile models are then used to map specific flexibility criteria that ultimately are required to facilitate change. This is achieved using the Flexibility Matrix of Change (FMoC) tool which was developed within the remit of this research. This tool is a qualitative measurement scheme that aligns WIS maintenance changes to a reciprocal flexibility attribute. Thus, the wider aim of this thesis is to also expand the awareness of flexibility and its importance as a key component of the WIS lifecycle.

Any model of access control has two fundamental aims: to ensure that resources are protected from inappropriate access and to ensure that access by authorised users is appropriate. Traditionally, approaches to access control have fallen into one of two categories: discretionary access control (DAC) or mandatory access control (MAC). More recently, role-based access control (RBAC) has offered the potential for a more manageable and flexible alternative. Typically, though, whichever model is adopted, any changes in the access control policy will have to be brought about via the intervention of a trusted administrator. In an ever-more connected world, with a drive towards autonomic computing, it is inevitable that a need for systems that support automatic policy updates in response to changes in the environment or user actions will emerge. Indeed, data management guidelines and legislation are often written at such a high level of abstraction that there is almost an implicit assumption that policies should react to contextual changes. Furthermore, as access control policies become more complicated, there is a clear need to express and reason about such entities at a higher level of abstraction for any meaningful analysis to be tractable, especially when consideration of complex state is involved. This thesis describes research conducted in formalising an approach to access control, termed evolving access control (EAC), that can support the automatic evolution of policies based on observed changes in the environment as dictated by high-level requirements embodied in a metapolicy. The contribution of this research is a formal, conceptual model of EAC which supports the construction, analysis and deployment of metapolicies and policies. The formal EAC model provides a framework to construct and describe metapolicies and to reason about how they manage the evolution of policies. Additionally, the model is used to analyse metapolicies for desirable properties, and to verify that policies adhere to the high-level requirements of the metapolicy. Furthermore, the model also allows the translation of verified policies to machine-readable representations, which can then be deployed in a system that supports fine-grained, dynamic access control.

The aim of this thesis is to examine the evolving relationship between food and tourism through the twentieth century. Devon, a county in the South West of England, and a popular tourist destination is used as the geographical focus of the case study. Previous studies have tended to focus on particular locations at a fixed point in time, not over the timescale of a century. The research presents a social and economic history of food in the context of tourism. It incorporates many food related interests reflecting the topical and evolving, embracing leisure, pleasure and social history, Burnett (2004). Food is presented from the perspectives of production and consumption, not only its commercial provision in the hospitality industry, but also that emanating from the domestic, home, and farmstead. The significance of food and tourism is emphasised by Hall and Sharples (2003), and Croce and Perri (2010) in the development of Food tourism (and Wine tourism), reflecting increasingly specialised and niche interests. However, this thesis aims to show how food and tourism encompasses, food, culture, and history, and plays an important role in the economic development of the county. The thesis presents multiple data sources, primary and secondary, questionnaires and in-depth interviews. It utilises these in conjunction with numerous historical records and archival materials to investigate evolving trends and patterns in the food and tourism evolution. A case study demonstrates ways in which food is an experience, attraction, and motivation to visit a destination, and shows how tourism’s relationship with food has evolved throughout the twentieth century.

The notion that a universally effective problem solver may still exist, and is simply waiting to be found, is slowly being abandoned in the light of a growing body of work reporting on the narrow applicability of individual heuristics. As the formalism of the constraint satisfaction problem remains a popular choice for the representation of problems to be solved algorithmically, there exists an ongoing need for new algorithms to effciently handle the disparate range of problems that have been posed in this representation. Given the costs associated with manually applying human algorithm development and problem solving expertise, methods that can automatically adapt to the particular features of a specific class of problem have begun to attract more attention. Whilst a number of authors have developed adaptive systems, the field, and particularly with respect to their application to constraint satisfaction problems, has seen only limited discussion as to what features are desirable for an adaptive constraint system. This may well have been a limiting factor with previous implementations, which have exhibited only subsets of the five features identified in this work as important to the utility of an adaptive constraint satisfaction system. Whether an adaptive system exhibits these features depends on both the chosen represen-tation and the method of adaptation. In this thesis, a three-part representation for constraint algorithms is introduced, which defines an algorithm in terms of contention, preference and selection functions. An adaptive system based on genetic programming is presented that adapts constraint algorithms described using the mentioned three-part representation. This is believed to be the first use of standard genetic programming for learning constraint algo-rithms. Finally, to further demonstrate the efficacy of this adaptive system, its performance in learning specialised algorithms for hard, real-world problem instances is thoroughly evaluated. These instances include random as well as structured instances from known-hard benchmark distributions, industrial problems (specifically, SAT-translated planning and cryptographic problems) as well as over-constrained problem instances. The outcome of this evaluation is a set of new algorithms - valuable in their own right - specifically tailored to these problem classes. Partial results of this work have appeared in the following publications: [1] Stuart Bain, John Thornton, and Abdul Sattar (2004) Evolving algorithms for constraint satisfaction. In Proc. of the 2004 Congress on Evolutionary Computation, pages 265-272. [2] Stuart Bain, John Thornton, and Abdul Sattar (2004) Methods of automatic algorithm generation. In Proc. of the 9th Pacific Rim Conference on AI, pages 144-153. [3] Stuart Bain, John Thornton, and Abdul Sattar. (2005) A comparison of evolutionary methods for the discovery of local search heuristics. In Australian Conference on Artificial Intelligence: AI'05, pages 1068-1074. [4] Stuart Bain, John Thornton, and Abdul Sattar (2005) Evolving variable-ordering heuristics for constrained optimisation. In Principles and Practice of Constraint Programming: CP'05, pages 732-736.