Biological control of prickly acacia: Current research and future prospects

Prickly acacia, Vachellia nilotica subsp. indica (syn. Acacia nilotica subsp. indica) (Fabaceae), a major weed in the natural grasslands of western Queensland, has been a target of biological control since the 1980s with limited success to date. Surveys in India, based on genetic and climate matching, identified five insects and two rust pathogens as potential agents. Host-specificity tests were conducted for the insects in India and under quarantine conditions in Australia, and for the rust pathogens under quarantine conditions at CABI in the UK. In no-choice tests, the brown leaf-webber, Phycita sp. A, (Lepidoptera: Pyralidae) completed development on 17 non-target plant species. Though the moth showed a clear preference for prickly acacia in oviposition choice trials screening of additional test-plant species was terminated in view of the potential non-target risk. The scale insect Anomalococcus indicus (Hemiptera: Lecanodiaspididae) developed into mature gravid females on 13 out of 58 non-target plant species tested. In the majority of cases very few female scales matured but development was comparable to that on prickly acacia on four of the non-target species. In multiple choice tests, the scale insect showed a significant preference for the target weed over non-target species tested. In a paired-choice trial under field conditions in India, crawler establishment occurred only on prickly acacia and not on the non-target species tested. Further choice trials are to be conducted under natural field conditions in India. A colony of the green leaf-webber Phycita sp. B has been established in quarantine facilities in Australia and host-specificity testing has commenced. The gall-rust Ravenelia acaciae-arabicae and the leaf-rust Ravenelia evansii (Puccineales: Raveneliaceae) both infected and produced viable urediniospores on Vachellia sutherlandii (Fabaceae), a non-target Australian native plant species. Hence, no further testing with the two rust species was pursued. Inoculation trials using the gall mite Aceria liopeltus (Acari: Eriophyidae) from V. nilotica subsp. kraussiana in South Africa resulted in no gall induction on V. nilotica subsp. indica. Future research will focus on the leaf-weevil Dereodus denticollis (Coleoptera: Curculionidae) and the leaf-beetle Pachnephorus sp. (Coleoptera: Chrysomelidae) under quarantine conditions in Australia. Native range surveys for additional potential biological control agents will also be pursued in northern and western Africa.

Locality and order-invariant logics

Malli on logiikassa käytetty abstraktio monille matemaattisille objekteille. Esimerkiksi verkot, ryhmät ja metriset avaruudet ovat malleja. Äärellisten mallien teoria on logiikan osa-alue, jossa tarkastellaan logiikkojen, formaalien kielten, ilmaisuvoimaa malleissa, joiden alkioiden lukumäärä on äärellinen. Rajoittuminen äärellisiin malleihin mahdollistaa tulosten soveltamisen teoreettisessa tietojenkäsittelytieteessä, jonka näkökulmasta logiikan kaavoja voidaan ajatella ohjelmina ja äärellisiä malleja niiden syötteinä. Lokaalisuus tarkoittaa logiikan kyvyttömyyttä erottaa toisistaan malleja, joiden paikalliset piirteet vastaavat toisiaan. Väitöskirjassa tarkastellaan useita lokaalisuuden muotoja ja niiden säilymistä logiikkoja yhdistellessä. Kehitettyjä työkaluja apuna käyttäen osoitetaan, että Gaifman- ja Hanf-lokaalisuudeksi kutsuttujen varianttien välissä on lokaalisuuskäsitteiden hierarkia, jonka eri tasot voidaan erottaa toisistaan kasvavaa dimensiota olevissa hiloissa. Toisaalta osoitetaan, että lokaalisuuskäsitteet eivät eroa toisistaan, kun rajoitutaan tarkastelemaan äärellisiä puita. Järjestysinvariantit logiikat ovat kieliä, joissa on käytössä sisäänrakennettu järjestysrelaatio, mutta sitä on käytettävä siten, etteivät kaavojen ilmaisemat asiat riipu valitusta järjestyksestä. Määritelmää voi motivoida tietojenkäsittelyn näkökulmasta: vaikka ohjelman syötteen tietojen järjestyksellä ei olisi odotetun tuloksen kannalta merkitystä, on syöte tietokoneen muistissa aina jossakin järjestyksessä, jota ohjelma voi laskennassaan hyödyntää. Väitöskirjassa tutkitaan minkälaisia lokaalisuuden muotoja järjestysinvariantit ensimmäisen kertaluvun predikaattilogiikan laajennukset yksipaikkaisilla kvanttoreilla voivat toteuttaa. Tuloksia sovelletaan tarkastelemalla, milloin sisäänrakennettu järjestys lisää logiikan ilmaisuvoimaa äärellisissä puissa.

Semantic Classes in Topic Detection and Tracking

Topic detection and tracking (TDT) is an area of information retrieval research the focus of which revolves around news events. The problems TDT deals with relate to segmenting news text into cohesive stories, detecting something new, previously unreported, tracking the development of a previously reported event, and grouping together news that discuss the same event. The performance of the traditional information retrieval techniques based on full-text similarity has remained inadequate for online production systems. It has been difficult to make the distinction between same and similar events. In this work, we explore ways of representing and comparing news documents in order to detect new events and track their development. First, however, we put forward a conceptual analysis of the notions of topic and event. The purpose is to clarify the terminology and align it with the process of news-making and the tradition of story-telling. Second, we present a framework for document similarity that is based on semantic classes, i.e., groups of words with similar meaning. We adopt people, organizations, and locations as semantic classes in addition to general terms. As each semantic class can be assigned its own similarity measure, document similarity can make use of ontologies, e.g., geographical taxonomies. The documents are compared class-wise, and the outcome is a weighted combination of class-wise similarities. Third, we incorporate temporal information into document similarity. We formalize the natural language temporal expressions occurring in the text, and use them to anchor the rest of the terms onto the time-line. Upon comparing documents for event-based similarity, we look not only at matching terms, but also how near their anchors are on the time-line. Fourth, we experiment with an adaptive variant of the semantic class similarity system. The news reflect changes in the real world, and in order to keep up, the system has to change its behavior based on the contents of the news stream. We put forward two strategies for rebuilding the topic representations and report experiment results. We run experiments with three annotated TDT corpora. The use of semantic classes increased the effectiveness of topic tracking by 10-30\% depending on the experimental setup. The gain in spotting new events remained lower, around 3-4\%. The anchoring the text to a time-line based on the temporal expressions gave a further 10\% increase the effectiveness of topic tracking. The gains in detecting new events, again, remained smaller. The adaptive systems did not improve the tracking results.

Methods for Answer Extraction in Textual Question Answering

In this thesis we present and evaluate two pattern matching based methods for answer extraction in textual question answering systems. A textual question answering system is a system that seeks answers to natural language questions from unstructured text. Textual question answering systems are an important research problem because as the amount of natural language text in digital format grows all the time, the need for novel methods for pinpointing important knowledge from the vast textual databases becomes more and more urgent. We concentrate on developing methods for the automatic creation of answer extraction patterns. A new type of extraction pattern is developed also. The pattern matching based approach chosen is interesting because of its language and application independence. The answer extraction methods are developed in the framework of our own question answering system. Publicly available datasets in English are used as training and evaluation data for the methods. The techniques developed are based on the well known methods of sequence alignment and hierarchical clustering. The similarity metric used is based on edit distance. The main conclusions of the research are that answer extraction patterns consisting of the most important words of the question and of the following information extracted from the answer context: plain words, part-of-speech tags, punctuation marks and capitalization patterns, can be used in the answer extraction module of a question answering system. This type of patterns and the two new methods for generating answer extraction patterns provide average results when compared to those produced by other systems using the same dataset. However, most answer extraction methods in the question answering systems tested with the same dataset are both hand crafted and based on a system-specific and fine-grained question classification. The the new methods developed in this thesis require no manual creation of answer extraction patterns. As a source of knowledge, they require a dataset of sample questions and answers, as well as a set of text documents that contain answers to most of the questions. The question classification used in the training data is a standard one and provided already in the publicly available data.

A Floor Control Server in a Distributed Conference Service

The conferencing systems in IP Multimedia (IM) networks are going through restructuring, accomplished in the near future. One of the changes introduced is the concept of floors and floor control in its current form with matching entity roles. The Binary Floor Control Protocol (BFCP) is a novelty to be exploited in distributed tightly coupled conferencing services. The protocol defines the floor control server (FCS), which implements floor control giving access to shared resources. As the newest tendency is to distribute the conferencing services, the locations of different functionality units play an important role in developing the standards. The floor control server location is not yet single-mindedly fixed in different standardization bodies, and the debate goes on where to place it within the media server, providing the conferencing service. The thesis main objective is to evaluate two distinctive alternatives in respect the Mp interface protocol between the respective nodes, as the interface in relation to floor control is under standardization work at the moment. The thesis gives a straightforward preamble in IMS network, nodes of interest including floor control server and conferencing. Knowledge on several protocols – BFCP, SDP, SIP and H.248 provides an important background for understanding the functionality changes introduced in the Mp interface and therefore introductions on those protocols and how they are connected to the full picture is given. The actual analysis on the impact of the floor control server into the Mp reference point is concluded in relation to the locations, giving basic flows, requirements analysis including a limited implementation proposal on supporting protocol parameters. The overall conclusion of the thesis is that even if both choices are seemingly useful, not one of the locations is clearly the most suitable in the light of this work. The thesis suggests a solution having both possibilities available to be chosen from in separate circumstances, realized with consistent standardization. It is evident, that if the preliminary assumption for the analysis is kept regarding to only one right place for the floor control server, more work is to be done in connected areas to discover the one most appropriate location.

Climate savvy grazing (Developing improved grazing and related practices to assist beef production enterprises across northern Australia to adapt to a changing and more variable climate)

There is uncertainty over the potential changes to rainfall across northern Australia under climate change. Since rainfall is a key driver of pasture growth, cattle numbers and the resulting animal productivity and beef business profitability, the ability to anticipate possible management strategies within such uncertainty is crucial. The Climate Savvy Grazing project used existing research, expert knowledge and computer modelling to explore the best-bet management strategies within best, median and worse-case future climate scenarios. All three scenarios indicated changes to the environment and resources upon which the grazing industry of northern Australia depends. Well-adapted management strategies under a changing climate are very similar to best practice within current climatic conditions. Maintaining good land condition builds resource resilience, maximises opportunities under higher rainfall years and reduces the risk of degradation during drought and failed wet seasons. Matching stocking rate to the safe long-term carrying capacity of the land is essential; reducing stock numbers in response to poor seasons and conservatively increasing stock numbers in response to better seasons generally improves profitability and maintains land in good condition. Spelling over the summer growing season will improve land condition under a changing climate as it does under current conditions. Six regions were included within the project. Of these, the Victoria River District in the Northern Territory, Gulf country of Queensland and the Kimberley region of Western Australia had projections of similar or higher than current rainfall and the potential for carrying capacity to increase. The Alice Springs, Maranoa-Balonne and Fitzroy regions had projections of generally drying conditions and the greatest risk of reduced pasture growth and carrying capacity. Encouraging producers to consider and act on the risks, opportunities and management options inherent in climate change was a key goal of the project. More than 60,000 beef producers, advisors and stakeholders are now more aware of the management strategies which build resource resilience, and that resilience helps buffer against the effects of variable and changing climatic conditions. Over 700 producers have stated they have improved confidence, skills and knowledge to attempt new practices to build resilience. During the course of the project, more than 165 beef producers reported they have implemented changes to build resource and business resilience.

Fracture Behavior of Multidirectional DCB Specimen: Higher-Order Beam Theories

Mathematical models, for the stress analysis of symmetric multidirectional double cantilever beam (DCB) specimen using classical beam theory, first and higher-order shear deformation beam theories, have been developed to determine the Mode I strain energy release rate (SERR) for symmetric multidirectional composites. The SERR has been calculated using the compliance approach. In the present study, both variationally and nonvariationally derived matching conditions have been applied at the crack tip of DCB specimen. For the unidirectional and cross-ply composite DCB specimens, beam models under both plane stress and plane strain conditions in the width direction are applicable with good performance where as for the multidirectional composite DCB specimen, only the beam model under plane strain condition in the width direction appears to be applicable with moderate performance. Among the shear deformation beam theories considered, the performance of higher-order shear deformation beam theory, having quadratic variation for transverse displacement over the thickness, is superior in determining the SERR for multidirectional DCB specimen.

Optimal popular matchings

In this paper we consider the problem of computing an “optimal” popular matching. We assume that our input instance View the MathML source admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness in which case we are required to return a fair popular matching. We show an O(n2+m) algorithm for this problem, assuming that the preference lists are strict, where m is the number of edges in G and n is the number of applicants.

A network forensics tool for precise data packet capture and replay in cyber-physical systems

Network data packet capture and replay capabilities are basic requirements for forensic analysis of faults and security-related anomalies, as well as for testing and development. Cyber-physical networks, in which data packets are used to monitor and control physical devices, must operate within strict timing constraints, in order to match the hardware devices' characteristics. Standard network monitoring tools are unsuitable for such systems because they cannot guarantee to capture all data packets, may introduce their own traffic into the network, and cannot reliably reproduce the original timing of data packets. Here we present a high-speed network forensics tool specifically designed for capturing and replaying data traffic in Supervisory Control and Data Acquisition systems. Unlike general-purpose "packet capture" tools it does not affect the observed network's data traffic and guarantees that the original packet ordering is preserved. Most importantly, it allows replay of network traffic precisely matching its original timing. The tool was implemented by developing novel user interface and back-end software for a special-purpose network interface card. Experimental results show a clear improvement in data capture and replay capabilities over standard network monitoring methods and general-purpose forensics solutions.

Using Mathematical Morphology for Geometric Music Retrieval

The usual task in music information retrieval (MIR) is to find occurrences of a monophonic query pattern within a music database, which can contain both monophonic and polyphonic content. The so-called query-by-humming systems are a famous instance of content-based MIR. In such a system, the user's hummed query is converted into symbolic form to perform search operations in a similarly encoded database. The symbolic representation (e.g., textual, MIDI or vector data) is typically a quantized and simplified version of the sampled audio data, yielding to faster search algorithms and space requirements that can be met in real-life situations. In this thesis, we investigate geometric approaches to MIR. We first study some musicological properties often needed in MIR algorithms, and then give a literature review on traditional (e.g., string-matching-based) MIR algorithms and novel techniques based on geometry. We also introduce some concepts from digital image processing, namely the mathematical morphology, which we will use to develop and implement four algorithms for geometric music retrieval. The symbolic representation in the case of our algorithms is a binary 2-D image. We use various morphological pre- and post-processing operations on the query and the database images to perform template matching / pattern recognition for the images. The algorithms are basically extensions to classic image correlation and hit-or-miss transformation techniques used widely in template matching applications. They aim to be a future extension to the retrieval engine of C-BRAHMS, which is a research project of the Department of Computer Science at University of Helsinki.

The determination of the refractive index of a photoelastic specimen by immersion technique

Conventional methods for determining the refractive index demand specimens of optical quality, the preparation of which is often very difficult. An indirect determination by matching the refractive indices of specimen and immersion liquid is a practical alternative for photoelastic specimen of nonoptical quality. An experimental arrangement used for this technique and observations made while matching the refractive indices of three different specimens are presented.

Essays on corporate governance, stakeholders, and restructuring

This dissertation consists of an introductory section and three theoretical essays analyzing the interaction of corporate governance and restructuring. The essays adopt an incomplete contracts approach and analyze the role of different institutional designs to facilitate the alignment of the objectives of shareholders and management (or employees) over the magnitude of corporate restructuring. The first essay analyzes how a firm's choice of production technology affects the employees' human capital investment. In the essay, the owners of the firm can choose between a specific and a general technology that both require a costly human capital investment by the employees. The specific technology is initially superior in using the human capital of employees but, in contrast to the general technology, it is not compatible with future innovations. As a result, anticipated changes in the specific technology diminish the ex ante incentives of the employees to invest in human capital unless the shareholders grant the employees specific governance mechanisms (a right of veto, severance pay) so as to protect their investments. The results of the first essay indicate that the level of protection that the shareholders are willing to offer falls short of the socially desirable one. Furthermore, when restructuring opportunities become more abundant, it becomes more attractive both socially and from the viewpoint of the shareholders to initially adopt the general technology. The second essay analyzes how the allocation of authority within the firm interacts with the owners' choice of business strategy when the ability of the owners to monitor the project proposals of the management is biased in favor of the status quo strategy. The essay shows that a bias in the monitoring ability will affect not only the allocation of authority within the firm but also the choice of business strategy. Especially, when delegation has positive managerial incentive effects, delegation turns out to be more attractive under the new business strategy because the improved managerial incentives are a way for the owners to compensate their own reduced information gathering ability. This effect, however, simultaneously makes the owners hesitant to switch the strategy since it would involve a more frequent loss of control over the project choice. Consequently, the owners' lack of knowledge of the new business strategy may lead to a suboptimal choice of strategy. The third essay analyzes the implications of CEO succession process for the ideal board structure. In this essay, the presence of the departing CEO on the board facilitates the ability of the board to find a matching successor and to counsel him. However, the ex-CEO's presence may simultaneously also weaken the ability of the board to restructure since the predecessor may use the opportunity to distort the successor's project choice. The results of the essay suggest that the extent of restructuring gains, the firm's ability to hire good outside directors and the importance of board's advisory role affect at which point and for how long the shareholders may want to nominate the predecessor to the board.

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.

Two Stage Transform Vector Quantization of LSFs for Wideband Speech Coding

We investigate the use of a two stage transform vector quantizer (TSTVQ) for coding of line spectral frequency (LSF) parameters in wideband speech coding. The first stage quantizer of TSTVQ, provides better matching of source distribution and the second stage quantizer provides additional coding gain through using an individual cluster specific decorrelating transform and variance normalization. Further coding gain is shown to be achieved by exploiting the slow time-varying nature of speech spectra and thus using inter-frame cluster continuity (ICC) property in the first stage of TSTVQ method. The proposed method saves 3-4 bits and reduces the computational complexity by 58-66%, compared to the traditional split vector quantizer (SVQ), but at the expense of 1.5-2.5 times of memory.

PolyPatEx : an R package for paternity exclusion in autopolyploids

Microsatellite markers have demonstrated their value for performing paternity exclusion and hence exploring mating patterns in plants and animals. Methodology is well established for diploid species, and several software packages exist for elucidating paternity in diploids; however, these issues are not so readily addressed in polyploids due to the increased complexity of the exclusion problem and a lack of available software. We introduce polypatex, an r package for paternity exclusion analysis using microsatellite data in autopolyploid, monoecious or dioecious/bisexual species with a ploidy of 4n, 6n or 8n. Given marker data for a set of offspring, their mothers and a set of candidate fathers, polypatex uses allele matching to exclude candidates whose marker alleles are incompatible with the alleles in each offspring–mother pair. polypatex can analyse marker data sets in which allele copy numbers are known (genotype data) or unknown (allelic phenotype data) – for data sets in which allele copy numbers are unknown, comparisons are made taking into account all possible genotypes that could arise from the compared allele sets. polypatex is a software tool that provides population geneticists with the ability to investigate the mating patterns of autopolyploids using paternity exclusion analysis on data from codominant markers having multiple alleles per locus.