Destination branding performance measurement : a non-technical discussion for practitioners

While academic interest in destination branding has been gathering momentum since the field commenced in the late 1990s, one important gap in this literature that has received relatively little attention to date is the measurement of destination brand performance. This paper sets out one method for assessing the performance of a destination brand over time. The intent is to present an approach that will appeal to marketing practitioners, and which is also conceptually sound. The method is underpinned by Decision Set Theory and the concept of Consumer-Based Brand Equity (CBBE), while the key variables mirror the branding objectives used by many destination marketing organisations (DMO). The approach is demonstrated in this paper to measure brand performance for Australia in the New Zealand market. It is suggested the findings provide indicators of both i) the success of previous marketing communications, and ii) future performance, which can be easily communicated to a DMO’s stakeholders.

Destination branding performance measurement for practitioners

While academic interest in destination branding has been gathering momentum since the field commenced in the late 1990s, one important gap in this literature that has received relatively little attention to date is the measurement of destination brand performance. This paper sets out one method for assessing the performance of a destination brand over time. The intent is to present an approach that will appeal to marketing practitioners, and which is also conceptually sound. The method is underpinned by Decision Set Theory and the concept of Consumer-Based Brand Equity (CBBE), while the key variables mirror the branding objectives used by many destination marketing organisations (DMO). The approach is demonstrated in this paper to measure brand performance for Australia in the New Zealand market. It is suggested the findings provide indicators of both i) the success of previous marketing communications, and ii) future performance, which can be easily communicated to a DMO’s stakeholders.

Exploring the challenges to industrialized residential building in China

Industrialised building (IB) is considered by many to have an important role to play in China's residential construction industry due to its potential for improved quality, productivity, efficiency, safety and sustainability. It is surprising, therefore, that although a large number of construction programmes have been completed in the country in recent years, very few have been built in this manner. Quite why this situation exists is unknown. The well-known problems with IB, such as the constraints placed on designer freedom, may be the cause. It is equally possible that, as is typical with developing countries such as China, cost or government issues dominate. On the other hand, in comparison with other countries, the construction industry in China has been widely criticised for its lack of modernity. Either way, there is an urgent need to assess and understand the hindrances to the adoption of IB in residential construction in order to identify what corrective measures, if any, need to be taken. Towards this end, we first identify a set of critical factors (CFs) for assessing the hindrances to IB adoption in China. This involves the analysis of research data collected by a questionnaire survey of experienced housing developers and professionals working in China's construction industry sector. Fuzzy set theory is used in the selection of the CFs. These CFs comprise, in rank order: higher initial cost; lack of skilled labour in IB; manufacturing capability and involvement issues and product quality problems; lack of supply chain; lack of codes and standards; and lack of government incentives, directives and promotion. The establishment of the CFs provides a basis for local construction sectors to better equip themselves for future implementation of IB. The findings also indicate a current need for formulating improved policies and strategies to encourage the further development of IB in China at present.

Fuzzy logic to evaluate driving maneuvers: An integrated approach to improve training

Driver training is one of the interventions aimed at mitigating the number of crashes that involve novice drivers. Our failure to understand what is really important for learners, in terms of risky driving, is one of the many drawbacks restraining us to build better training programs. Currently, there is a need to develop and evaluate Advanced Driving Assistance Systems that could comprehensively assess driving competencies. The aim of this paper is to present a novel Intelligent Driver Training System (IDTS) that analyses crash risks for a given driving situation, providing avenues for improvement and personalisation of driver training programs. The analysis takes into account numerous variables acquired synchronously from the Driver, the Vehicle and the Environment (DVE). The system then segments out the manoeuvres within a drive. This paper further presents the usage of fuzzy set theory to develop the safety inference rules for each manoeuvre executed during the drive. This paper presents a framework and its associated prototype that can be used to comprehensively view and assess complex driving manoeuvres and then provide a comprehensive analysis of the drive used to give feedback to novice drivers.

Feature selection using expected attainable discrimination

We propose expected attainable discrimination (EAD) as a measure to select discrete valued features for reliable discrimination between two classes of data. EAD is an average of the area under the ROC curves obtained when a simple histogram probability density model is trained and tested on many random partitions of a data set. EAD can be incorporated into various stepwise search methods to determine promising subsets of features, particularly when misclassification costs are difficult or impossible to specify. Experimental application to the problem of risk prediction in pregnancy is described.

Measuring corruption in public construction projects in China

Corruption has been identified as the greatest obstacle to economic and social development. Public construction projects, in particular, face high corruption risk as public construction sector has been consecutively deemed as the most corrupt one. Despite considerable efforts have been undertaken to measure corruption at a nation level, few focus on the measurement of corruption in construction projects. This paper develops a fuzzy measurement model for the potential corruption in public construction projects in China. Through semi-structured interviews with 14 experts, followed by a questionnaire survey with 188 respondents, 24 measurement items of corruption were identified and further categorized into five constructs. The fuzzy set theory was then adopted to quantify each measurement item, construct and the overall corruption level. This model can facilitate in evaluating, revealing and monitoring corruption in public construction projects. Although this study focuses on measuring corruption in public construction projects in China, similar research methods can be applied in other countries around the world and thus contribute to the global body of knowledge of corruption.

Improved Kalman filter initialisation using neurofuzzy estimation

It is traditional to initialise Kalman filters and extended Kalman filters with estimates of the states calculated directly from the observed (raw) noisy inputs, but unfortunately their performance is extremely sensitive to state initialisation accuracy: good initial state estimates ensure fast convergence whereas poor estimates may give rise to slow convergence or even filter divergence. Divergence is generally due to excessive observation noise and leads to error magnitudes that quickly become unbounded (R.J. Fitzgerald, 1971). When a filter diverges, it must be re initialised but because the observations are extremely poor, re initialised states will have poor estimates. The paper proposes that if neurofuzzy estimators produce more accurate state estimates than those calculated from the observed noisy inputs (using the known state model), then neurofuzzy estimates can be used to initialise the states of Kalman and extended Kalman filters. Filters whose states have been initialised with neurofuzzy estimates should give improved performance by way of faster convergence when the filter is initialised, and when a filter is re started after divergence

Principles of Pitch Organization in Béla Bartók's 'Duke Bluebeard's Castle'

The topic of my doctoral thesis is to demonstrate the usefulness of incorporating tonal and modal elements into a pitch-web square analysis of Béla Bartók's (1881-1945) opera, 'A kékszakállú herceg vára' ('Duke Bluebeard's Castle'). My specific goal is to demonstrate that different musical materials, which exist as foreground melodies or long-term key progressions, are unified by the unordered pitch set {0,1,4}, which becomes prominent in different sections of Bartók's opera. In Bluebeard's Castle, the set {0,1,4} is also found as a subset of several tetrachords: {0,1,4,7}, {0,1,4,8}, and {0,3,4,7}. My claim is that {0,1,4} serves to link music materials between themes, between sections, and also between scenes. This study develops an analytical method, drawn from various theoretical perspectives, for conceiving superposed diatonic spaces within a hybrid pitch-space comprised of diatonic and chromatic features. The integrity of diatonic melodic lines is retained, which allows for a non-reductive understanding of diatonic superposition, without appealing to pitch centers or specifying complete diatonic collections. Through combining various theoretical insights of the Hungarian scholar Ernő Lendvai, and the American theorists Elliott Antokoletz, Paul Wilson and Allen Forte, as well as the composer himself, this study gives a detailed analysis of the opera's pitch material in a way that combines, complements, and expands upon the studies of those scholars. The analyzed pitch sets are represented on Aarre Joutsenvirta's note-web square, which adds a new aspect to the field of Bartók analysis. Keywords: Bartók, Duke Bluebeard's Castle (Op. 11), Ernő Lendvai, axis system, Elliott Antokoletz, intervallic cycles, intervallic cells, Allen Forte, set theory, interval classes, interval vectors, Aarre Joutsenvirta, pitch-web square, pitch-web analysis.

Devolution of forest-related rights: Comparative analyses of six developing countries

The study focused on the different ways that forest-related rights can be devolved to the local level according to the current legal frameworks in Laos, Nepal, Vietnam, Kenya, Mozambique and Tanzania. The eleven case studies represented the main ways in which forest-related rights can be devolved to communities or households in these countries. The objectives of this study were to 1) analyse the contents and extent of forest-related rights that can be devolved to the local level, 2) develop an empirical typology that represents the main types of devolution, and 3) compare the cases against a theoretical ideal type to assess in what way and to what extent the cases are similar to or differ from the theoretical construct. Fuzzy set theory, Qualitative Comparative Analysis and ideal type analysis were used in analysing the case studies and in developing an empirical typology. The theoretical framework, which guided data collection and analyses, was based on institutional economics and theories on property rights, common pool resources and collective action. On the basis of the theoretical and empirical knowledge, the most important attributes of rights were defined as use rights, management rights, exclusion rights, transfer rights and the duration and security of the rights. The ideal type was defined as one where local actors have been devolved comprehensive use rights, extensive management rights, rights to exclude others from the resource and rights to transfer these rights. In addition, the rights are to be secure and held perpetually. The ideal type was used to structure the analysis and as a tool against which the cases were analysed. The contents, extent and duration of the devolved rights varied greatly. In general, the results show that devolution has mainly meant the transfer of use rights to the local level, and has not really changed the overall state control over forest resources. In most cases the right holders participate, or have a limited role in the decision making regarding the harvesting and management of the resource. There was a clear tendency to devolve the rights to enforce rules and to monitor resource use and condition more extensively than the powers to decide on the management and development of the resource. The empirical typology of the cases differentiated between five different types of devolution. The types can be characterised by the devolution of 1) restricted use and control rights, 2) extensive use rights but restricted control rights, 3) extensive rights, 4) insecure, short term use and restricted control rights, and 5) insecure extensive rights. Overall, the case studies conformity to the ideal type was very low: only two cases were similar to the ideal type, all other cases differed considerably from the ideal type. The restricted management rights were the most common reason for the low conformity to the ideal type (eight cases). In three cases, the short term of the rights, restricted transfer rights, restricted use rights or restricted exclusion rights were the reason or one of the reasons for the low conformity to the ideal type. In two cases the rights were not secure.

On linear order and computation : The expressiveness of interactive computations on linear orders and computations indexed by ordinals

We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a normal form for quantifier-rank equivalence classes of linear orders in first-order logic, infinitary logic, and generalized-infinitary logics with linearly ordered clocks. We show that Scott Sentences can be manipulated quickly, classified into local information, and consistency can be decided effectively in the length of the Scott Sentence. We describe a finite set of linked automata moving continuously on a linear order. Running them on ordinals, we compute the ordinal truth predicate and compute truth in the constructible universe of set-theory. Among the corollaries are a study of semi-models as efficient database of both model-theoretic and formulaic information, and a new proof of the atomicity of the Boolean algebra of sentences consistent with the theory of linear order -- i.e., that the finitely axiomatized theories of linear order are dense.

On Games on Non-Wellfounded Sets and Stationary Sets

In this thesis we study a few games related to non-wellfounded and stationary sets. Games have turned out to be an important tool in mathematical logic ranging from semantic games defining the truth of a sentence in a given logic to for example games on real numbers whose determinacies have important effects on the consistency of certain large cardinal assumptions. The equality of non-wellfounded sets can be determined by a so called bisimulation game already used to identify processes in theoretical computer science and possible world models for modal logic. Here we present a game to classify non-wellfounded sets according to their branching structure. We also study games on stationary sets moving back to classical wellfounded set theory. We also describe a way to approximate non-wellfounded sets with hereditarily finite wellfounded sets. The framework used to do this is domain theory. In the Banach-Mazur game, also called the ideal game, the players play a descending sequence of stationary sets and the second player tries to keep their intersection stationary. The game is connected to precipitousness of the corresponding ideal. In the pressing down game first player plays regressive functions defined on stationary sets and the second player responds with a stationary set where the function is constant trying to keep the intersection stationary. This game has applications in model theory to the determinacy of the Ehrenfeucht-Fraisse game. We show that it is consistent that these games are not equivalent.

Fuzzy-expert approach for voltage-reactive power dispatch

The voltage stability control problem has become an important concern for utilities transmitting power over long distances. This paper presents an approach using fuzzy set theory for reactive power control with the purpose of improving the voltage stability of a power system. To minimize the voltage deviations from pre-desired values of all the load buses, using the sensitivities with respect to reactive power control variables form the basis of the proposed fuzzy logic control (FLC). Control variables considered are switchable VAR compensators, On Load Tap Changing (OLTC) transformers and generator excitations. Voltage deviations and controlling variables are translated into fuzzy set notations to formulate the relation between voltage deviations and controlling ability of controlling devices. The developed fuzzy system is tested on a few simulated practical Indian power systems and some IEEE standard test systems. The performance of the fuzzy system is compared with conventional optimization technique and results obtained are encouraging. Results obtained for a 24 - node equivalent EHV system of part of Indian southern grid and IEEE New England 39-bus system are presented for illustration purposes. The proposed Fuzzy-Expert technique is found suitable for on-line applications in energy control centre as the solution is obtained fast with significant speedups.

Playing Games on Sets and Models

The most prominent objective of the thesis is the development of the generalized descriptive set theory, as we call it. There, we study the space of all functions from a fixed uncountable cardinal to itself, or to a finite set of size two. These correspond to generalized notions of the universal Baire space (functions from natural numbers to themselves with the product topology) and the Cantor space (functions from natural numbers to the {0,1}-set) respectively. We generalize the notion of Borel sets in three different ways and study the corresponding Borel structures with the aims of generalizing classical theorems of descriptive set theory or providing counter examples. In particular we are interested in equivalence relations on these spaces and their Borel reducibility to each other. The last chapter shows, using game-theoretic techniques, that the order of Borel equivalence relations under Borel reduciblity has very high complexity. The techniques in the above described set theoretical side of the thesis include forcing, general topological notions such as meager sets and combinatorial games of infinite length. By coding uncountable models to functions, we are able to apply the understanding of the generalized descriptive set theory to the model theory of uncountable models. The links between the theorems of model theory (including Shelah's classification theory) and the theorems in pure set theory are provided using game theoretic techniques from Ehrenfeucht-Fraïssé games in model theory to cub-games in set theory. The bottom line of the research declairs that the descriptive (set theoretic) complexity of an isomorphism relation of a first-order definable model class goes in synch with the stability theoretical complexity of the corresponding first-order theory. The first chapter of the thesis has slightly different focus and is purely concerned with a certain modification of the well known Ehrenfeucht-Fraïssé games. There we (me and my supervisor Tapani Hyttinen) answer some natural questions about that game mainly concerning determinacy and its relation to the standard EF-game

Proofs, Paradoxes, and Probabilities : The Logical Turn of Philosophy in Finland

This monograph describes the emergence of independent research on logic in Finland. The emphasis is placed on three well-known students of Eino Kaila: Georg Henrik von Wright (1916-2003), Erik Stenius (1911-1990), and Oiva Ketonen (1913-2000), and their research between the early 1930s and the early 1950s. The early academic work of these scholars laid the foundations for today's strong tradition in logic in Finland and also became internationally recognized. However, due attention has not been given to these works later, nor have they been comprehensively presented together. Each chapter of the book focuses on the life and work of one of Kaila's aforementioned students, with a fourth chapter discussing works on logic by authors who would later become known within other disciplines. Through an extensive use of correspondence and other archived material, some insight has been gained into the persons behind the academic personae. Unique and unpublished biographical material has been available for this task. The chapter on Oiva Ketonen focuses primarily on his work on what is today known as proof theory, especially on his proof theoretical system with invertible rules that permits a terminating root-first proof search. The independency of the parallel postulate is proved as an example of the strength of root-first proof search. Ketonen was to our knowledge Gerhard Gentzen's (the 'father' of proof theory) only student. Correspondence and a hitherto unavailable autobiographic manuscript, in addition to an unpublished article on the relationship between logic and epistemology, is presented. The chapter on Erik Stenius discusses his work on paradoxes and set theory, more specifically on how a rigid theory of definitions is employed to avoid these paradoxes. A presentation by Paul Bernays on Stenius' attempt at a proof of the consistency of arithmetic is reconstructed based on Bernays' lecture notes. Stenius correspondence with Paul Bernays, Evert Beth, and Georg Kreisel is discussed. The chapter on Georg Henrik von Wright presents his early work on probability and epistemology, along with his later work on modal logic that made him internationally famous. Correspondence from various archives (especially with Kaila and Charlie Dunbar Broad) further discusses his academic achievements and his experiences during the challenging circumstances of the 1940s.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.