An algebraic algorithm for the design and analysis of linear dynamical systems

In an earlier paper [1], it has been shown that velocity ratio, defined with reference to the analogous circuit, is a basic parameter in the complete analysis of a linear one-dimensional dynamical system. In this paper it is shown that the terms constituting velocity ratio can be readily determined by means of an algebraic algorithm developed from a heuristic study of the process of transfer matrix multiplication. The algorithm permits the set of most significant terms at a particular frequency of interest to be identified from a knowledge of the relative magnitudes of the impedances of the constituent elements of a proposed configuration. This feature makes the algorithm a potential tool in a first approach to a rational design of a complex dynamical filter. This algorithm is particularly suited for the desk analysis of a medium size system with lumped as well as distributed elements.

Deterministic Division Algorithm in a Negative Base

Described here is a deterministic division algorithm in a negative-base number system; here, the divisor is mapped into a suitable range by premultiplication, so that the choice of the quotient digit is deterministic.

Growth analysis and biomass partitioning of Cyperus iria in response to rice planting density and nitrogen rate

Cyperus iria is a weed of rice with widespread occurrence throughout the world. Because of concerns about excessive and injudicious use of herbicides, cultural weed management approaches that are safe and economical are needed. Developing such approaches will require a better understanding of weed biology and ecology, as well as of weed response to increases in crop density and nutrition. Knowledge of the effects of nitrogen (N) fertilizer on crop-weed competitive interactions could also help in the development of integrated weed management strategies. The present study was conducted in a screenhouse to determine the effects of rice planting density (0, 5, 10, and 20 plants pot−1) and N rate (0, 50, 100, and 150 kg ha−1) on the growth of C. iria. Tiller number per plant decreased by 73–88%, leaf number by 85–94%, leaf area by 85–98%, leaf biomass by 92–99%, and inflorescence biomass by 96–99% when weed plants were grown at 20 rice plants pot−1 (i.e., 400 plants m−2) compared with weed plants grown alone. All of these parameters increased when N rates were increased. On average, weed biomass increased by 118–389% and rice biomass by 121–275% with application of 50–150 kg N ha−1, compared to control. Addition of N favored weed biomass production relative to rice biomass. Increased N rates reduced the root-to-shoot weight ratio of C. iria. Rice interference reduced weed growth and biomass and completely suppressed C. iria when no N was applied at high planting densities (i.e., 20 plants pot−1). The weed showed phenotypic plasticity in response to N application, and the addition of N increased the competitive ability of the weed over rice at densities of 5 and 10 rice plants pot−1 compared with 20 plants pot−1. The results of the present study suggest that high rice density (i.e., 400 plants m−2) can help suppress C. iria growth even at high N rates (150 kg ha−1).

Grazing impacts on the susceptibility of rangelands to wind erosion: The effects of stocking rate, stocking strategy and land condition

An estimated 110 Mt of dust is eroded by wind from the Australian land surface each year, most of which originates from the arid and semi-arid rangelands. Livestock production is thought to increase the susceptibility of the rangelands to wind erosion by reducing vegetation cover and modifying surface soil stability. However, research is yet to quantify the impacts of grazing land management on the erodibility of the Australian rangelands, or determine how these impacts vary among land types and over time. We present a simulation analysis that links a pasture growth and animal production model (GRASP) to the Australian Land Erodibility Model (AUSLEM) to evaluate the impacts of stocking rate, stocking strategy and land condition on the erodibility of four land types in western Queensland, Australia. Our results show that declining land condition, over stocking, and using inflexible stocking strategies have potential to increase land erodibility and amplify accelerated soil erosion. However, land erodibility responses to grazing are complex and influenced by land type sensitivities to different grazing strategies and local climate characteristics. Our simulations show that land types which are more resilient to livestock grazing tend to be least susceptible to accelerated wind erosion. Increases in land erodibility are found to occur most often during climatic transitions when vegetation cover is most sensitive to grazing pressure. However, grazing effects are limited during extreme wet and dry periods when the influence of climate on vegetation cover is strongest. Our research provides the opportunity to estimate the effects of different land management practices across a range of land types, and provides a better understanding of the mechanisms of accelerated erosion resulting from pastoral activities. The approach could help further assessment of land erodibility at a broader scale notably if combined with wind erosion models.

Computational Methods for Detecting Large-Scale Chromosome Rearrangements in SNP Data

Large-scale chromosome rearrangements such as copy number variants (CNVs) and inversions encompass a considerable proportion of the genetic variation between human individuals. In a number of cases, they have been closely linked with various inheritable diseases. Single-nucleotide polymorphisms (SNPs) are another large part of the genetic variance between individuals. They are also typically abundant and their measuring is straightforward and cheap. This thesis presents computational means of using SNPs to detect the presence of inversions and deletions, a particular variety of CNVs. Technically, the inversion-detection algorithm detects the suppressed recombination rate between inverted and non-inverted haplotype populations whereas the deletion-detection algorithm uses the EM-algorithm to estimate the haplotype frequencies of a window with and without a deletion haplotype. As a contribution to population biology, a coalescent simulator for simulating inversion polymorphisms has been developed. Coalescent simulation is a backward-in-time method of modelling population ancestry. Technically, the simulator also models multiple crossovers by using the Counting model as the chiasma interference model. Finally, this thesis includes an experimental section. The aforementioned methods were tested on synthetic data to evaluate their power and specificity. They were also applied to the HapMap Phase II and Phase III data sets, yielding a number of candidates for previously unknown inversions, deletions and also correctly detecting known such rearrangements.

TCP Performance in Heterogeneous Wireless Networks

The TCP protocol is used by most Internet applications today, including the recent mobile wireless terminals that use TCP for their World-Wide Web, E-mail and other traffic. The recent wireless network technologies, such as GPRS, are known to cause delay spikes in packet transfer. This causes unnecessary TCP retransmission timeouts. This dissertation proposes a mechanism, Forward RTO-Recovery (F-RTO) for detecting the unnecessary TCP retransmission timeouts and thus allow TCP to take appropriate follow-up actions. We analyze a Linux F-RTO implementation in various network scenarios and investigate different alternatives to the basic algorithm. The second part of this dissertation is focused on quickly adapting the TCP's transmission rate when the underlying link characteristics change suddenly. This can happen, for example, due to vertical hand-offs between GPRS and WLAN wireless technologies. We investigate the Quick-Start algorithm that, in collaboration with the network routers, aims to quickly probe the available bandwidth on a network path, and allow TCP's congestion control algorithms to use that information. By extensive simulations we study the different router algorithms and parameters for Quick-Start, and discuss the challenges Quick-Start faces in the current Internet. We also study the performance of Quick-Start when applied to vertical hand-offs between different wireless link technologies.

Efficient search for statistically significant dependency rules in binary data

Analyzing statistical dependencies is a fundamental problem in all empirical science. Dependencies help us understand causes and effects, create new scientific theories, and invent cures to problems. Nowadays, large amounts of data is available, but efficient computational tools for analyzing the data are missing. In this research, we develop efficient algorithms for a commonly occurring search problem - searching for the statistically most significant dependency rules in binary data. We consider dependency rules of the form X->A or X->not A, where X is a set of positive-valued attributes and A is a single attribute. Such rules describe which factors either increase or decrease the probability of the consequent A. A classical example are genetic and environmental factors, which can either cause or prevent a disease. The emphasis in this research is that the discovered dependencies should be genuine - i.e. they should also hold in future data. This is an important distinction from the traditional association rules, which - in spite of their name and a similar appearance to dependency rules - do not necessarily represent statistical dependencies at all or represent only spurious connections, which occur by chance. Therefore, the principal objective is to search for the rules with statistical significance measures. Another important objective is to search for only non-redundant rules, which express the real causes of dependence, without any occasional extra factors. The extra factors do not add any new information on the dependence, but can only blur it and make it less accurate in future data. The problem is computationally very demanding, because the number of all possible rules increases exponentially with the number of attributes. In addition, neither the statistical dependency nor the statistical significance are monotonic properties, which means that the traditional pruning techniques do not work. As a solution, we first derive the mathematical basis for pruning the search space with any well-behaving statistical significance measures. The mathematical theory is complemented by a new algorithmic invention, which enables an efficient search without any heuristic restrictions. The resulting algorithm can be used to search for both positive and negative dependencies with any commonly used statistical measures, like Fisher's exact test, the chi-squared measure, mutual information, and z scores. According to our experiments, the algorithm is well-scalable, especially with Fisher's exact test. It can easily handle even the densest data sets with 10000-20000 attributes. Still, the results are globally optimal, which is a remarkable improvement over the existing solutions. In practice, this means that the user does not have to worry whether the dependencies hold in future data or if the data still contains better, but undiscovered dependencies.

FreeS: A fast algorithm to discover frequent free subtrees using a novel canonical form

Web data can often be represented in free tree form; however, free tree mining methods seldom exist. In this paper, a computationally fast algorithm FreeS is presented to discover all frequently occurring free subtrees in a database of labelled free trees. FreeS is designed using an optimal canonical form, BOCF that can uniquely represent free trees even during the presence of isomorphism. To avoid enumeration of false positive candidates, it utilises the enumeration approach based on a tree-structure guided scheme. This paper presents lemmas that introduce conditions to conform the generation of free tree candidates during enumeration. Empirical study using both real and synthetic datasets shows that FreeS is scalable and significantly outperforms (i.e. few orders of magnitude faster than) the state-of-the-art frequent free tree mining algorithms, HybridTreeMiner and FreeTreeMiner.

Carbon dioxide emissions in the short run: The rate and sources of economic growth matter

This paper investigates the short-run effects of economic growth on carbon dioxide emissions from the combustion of fossil fuels and the manufacture of cement for 189 countries over the period 1961-2010. Contrary to what has previously been reported, we conclude that there is no strong evidence that the emissions-income elasticity is larger during individual years of economic expansion as compared to recession. Significant evidence of asymmetry emerges when effects over longer periods are considered. We find that economic growth tends to increase emissions not only in the same year, but also in subsequent years. Delayed effects - especially noticeable in the road transport sector - mean that emissions tend to grow more quickly after booms and more slowly after recessions. Emissions are more sensitive to fluctuations in industrial value added than agricultural value added, with services being an intermediate case. On the expenditure side, growth in consumption and growth in investment have similar implications for national emissions. External shocks have a relatively large emissions impact, and the short-run emissions-income elasticity does not appear to decline as incomes increase. Economic growth and emissions have been more tightly linked in fossil-fuel rich countries.

Fine root dry matter relative to mango (Mangifera indica) tree scion size grafted on size-controlling rootstocks, is negatively related to scion growth rate

Knowledge of root dry matter (DM) allocation, in relation to differing vigour conferred by rootstock cultivars, is required to understand the structural relationships between rootstock and scion. We investigated the mass of roots (four size classes up to 23 mm diameter) by coring proximal to five polyembryonic mango rootstock cultivars known to differ in their effects on the vigour and productivity of scion cultivar ‘Kensington Pride’, in a field trial of 13-year-old trees. Significant differences in fine (<0.64 and 0.64–1.88 mm diameter) and small (1.88–7.50 mm) root DM contents were observed between rootstock cultivars. There was a complex relationship between the amount of feeder (fine and small size classes) roots and scion size (trunk cross sectional area, TCSA), with intermediate size trees on rootstock MYP having the most feeder roots, while the smallest trees, on the rootstock Vellaikulamban had the least of these roots. Across rootstock cultivars, tree vigour (TCSA growth rate) was negatively and significantly related to the ratio of fine root DM/scion TCSA, suggesting this may be a useful indicator of the vigour that different rootstocks confer on the scion. In contrast non-ratio root DM and scion TCSA results had no significant relationships. The significant rootstock effects on orchard root growth and tree size could not be predicted from earlier differences in nursery seedling vigour, nor did seedling vigour predict root DM allocation.

Influence of Lithium Fluoride on the Burning Rate of AP-Polyester Propellant

THE addition of catalysts normally serves the purpose of imparting a desired burning rate change in a composite propellant. These may either retard or enhance the burning rate. Some often quoted catalysts are oxides, chromites and chromates of metals. A lot of work has been done on rinding the effect of the addition of some of these catalysts on the burning rate; however, none seems to have appeared on the influence of lithium fluoride (LiF). Only qualitative reduction in the burning rate of composite propellants with the addition of LiF was reported by Williams et al.1 Dickinson and Jackson2 reported a slight decrease in the specific impulse of composite propellant with the addition of LiF; however, they made no mention of the effect of its addition on the burning rate. We have studied the effect of the addition of varying amounts of LiF on the burning rate of Ammonium Perchlorate (AP)-Polyester propellant.

Initialisation flaws in the A5-GMR-1 satphone encryption algorithm

A5-GMR-1 is a synchronous stream cipher used to provide confidentiality for communications between satellite phones and satellites. The keystream generator may be considered as a finite state machine, with an internal state of 81 bits. The design is based on four linear feedback shift registers, three of which are irregularly clocked. The keystream generator takes a 64-bit secret key and 19-bit frame number as inputs, and produces an output keystream of length between $2^8$ and $2^{10}$ bits. Analysis of the initialisation process for the keystream generator reveals serious flaws which significantly reduce the number of distinct keystreams that the generator can produce. Multiple (key, frame number) pairs produce the same keystream, and the relationship between the various pairs is easy to determine. Additionally, many of the keystream sequences produced are phase shifted versions of each other, for very small phase shifts. These features increase the effectiveness of generic time-memory tradeoff attacks on the cipher, making such attacks feasible.

Equivalent rate 1/2 quasi-cyclic codes

Chen et al. [1] give a list of quasi-cyclic (2m,m) codes which have the largest minimum distance of any quasi-cyclic code, for various values ofm. We present the weight distribution of these codes. It will be seen that many of the codes found by Chen et al. [1] are equivalent in the sense of having identical weight distributions.