Effects of living crown reduction on needle element status of Scots pine

A wide range of biotic and abiotic factors, operating over different time perspectives and intensities, cause defoliation and a rapid decrease in the crown size of trees. Scleroderris canker disease [Gremmeniella abietina (Lagerb.) Morelet] has caused widespread crown reduction and tree mortality in Scots pine (Pinus sylvestris L) in forests in Scandinavia during the last three decades. In the 1980's, attempts were made to show, on the basis of the higher foliar N and S concentrations of affected pines in the diseased area, that sulphur and nitrogen deposition predispose trees to G. abietina. Unfortunately, in many studies on defoliated trees, exceptionally high or low needle mineral nutrient concentrations are still often interpreted as one of the causes of tree injury and not, conversely, as the result. In this thesis, three different field experiments, with foliar analysis as the main study method, were conducted in order to asses the possible long-term effects of living crown reduction on the needle nutrient concentrations of Scots pine trees in southern Finland. The crown ratio and length of the living crown were used to estimate the amount of defoliation in the reduced canopies. The material for the partial studies was collected and a total of 968 foliar samples were analysed individually (15-17 elements/sample) on a total of 488 sample trees (140 diseased, 116 pruned and 232 control trees) during the years 1987-1996 in 13 Scots pine stands. All the three experiments of this thesis provided significant evidence that severe, disease-induced defoliation or artificial pruning of the living branches can induce long-lasting nutritional changes in the foliage of the recovering trees under the typical growing conditions for Scots pine. The foliar concentrations of all the 17 mineral nutrients/elements analysed were affected, to a varying degree, by artificial pruning during the following three years. Although Scots pine, as an evergreen conifer, is considered to have low induced chemical responses to defoliation, this study proved experimentally under natural forest conditions that severe artificial pruning or disease-induced defoliation of Scots pine trees may induce biologically significant changes in the concentrations of most of the important macro- and micronutrients, as well as of carbon, in refoliated needles. Concerning the studies in this thesis, I find the results significant in providing new information about the long-term effects of rapid living crown reduction on the foliar nutrient and element status of Scots pine trees. Key words: Foliar analysis, defoliation, needle loss, pruning, nutrients, Pinus sylvestris, Gremmeniella abietina

Re-thinking mango disease management in Australia; the rationale and approach

The shelf life of mangoes is limited by two main postharvest diseases when not consistently managed. These are anthracnose ( Colletotrichum gloeosporioides) and stem end rots (SER) ( Fusicoccum parvum). The management of these diseases has often relied mainly on the use of fungicides either as field spray treatments or as postharvest dips. These have done a fairly good job at serving the industry and allowing fruits to be transported, stored and sold at markets distant from the areas of production. There are however concerns on the continuous use of these fungicides as the main or only tool for the management of these diseases. This has necessitated a re-think of how these diseases could be sustainably managed into the future using a systems approach that focuses on integrated crop management. It is a holistic approach that considers all the crop protection management strategies including the genetics of the plant and its ability to naturally defend itself from infection with plant activators and growth regulators. It also considers other cultural or agronomic management tools such as the use of crop nutrition, timely application of irrigation water and the pruning of trees on a regular basis as a means of reducing inoculum levels in the orchards. The ultimate aim of this approach is to increase yields and obtain long term sustainable production. It is guided by the sustainable crop production principle which states that producers should apply as little inputs as possible but as much as needed.

Veneer Grade Analysis of Early to Mid-rotation Plantation Eucalyptus Species in Australia

Processing Australian hardwood plantations into rotary veneer can produce more acceptable marketable product recoveries compared to traditional processing techniques (e.g. sawmilling). Veneers resulting from processing trials from six commercially important Australian hardwood species were dominated by D-grade veneer. Defects such as encased knots, gum pockets, gum veins, surface roughness, splits, bark pockets, and decay impacted the final assigned grade. Four grading scenarios were adopted. The first included a change to the grade limitations for gum pockets and gum veins, while the second investigated the potential impact of effective pruning on grade recovery. Although both scenarios individually had a positive impact on achieving higher face grade veneer qualities, the third and fourth scenarios, which combined both, had a substantial impact, with relative veneer values increasing up to 18.2% using conservative calculations (scenario three) or up to 22.6% (scenario four) where some of the upgraded veneers were further upgraded to A-grade, which attracts superior value. The total change in veneer value was found to depend on the average billet diameter unless defects other than those relating to the scenarios (gum or knots) restricted the benefit of pruning and gum upgrading. This was the case for species prone to high levels of growth stress and related defects.

Increasing the productivity of avocado orchards using high-density plantings: A review

There is strong interest in the use of high-density plantings to increase the productivity of avocado (Persea americana) orchards. Close plantings have the potential for higher yields and returns than standard or traditional plantings, especially in the early years of production. The success of this technology is dependent on the use of methods to control shoot growth and maximise light interception as the trees begin to bear fruit. We reviewed the performance of high-density orchards in different environments, and the success of efforts to control the growth of the trees through the use of dwarfing material, canopy management and growth regulators. Close plantings generally produce higher yields in the first few years of bearing compared with the yields of standard plantings. However, in most growing areas, the trees in the close plantings soon begin to crowd each other and yields decline. This usually occurs despite efforts to control shoot growth by pruning the trees or by applying growth regulators. Efforts to breed dwarfing rootstocks that can control the growth of mature trees have been largely unsuccessful. In the absence of dwarfing material, effective canopy management appears to be the largest barrier to success of high-density orchards. Further research on the use of different pruning strategies and growth regulators to control the growth of the trees and maximise light interception is required. There are potential problems with some of the growth regulators persisting in the harvested fruit and soil under certain circumstances.

Variation in rotary veneer recovery from australian plantation Eucalyptus globulus and Eucalyptus nitens

The processing of Australian plantation-grown Eucalyptus globulus and E. nitens into rotary veneer was shown to produce acceptable recoveries. Three plantation sites for each species were sampled. Silvicultural treatments (thinning and pruning) and growing environments varied between sites. Graded veneer recoveries were dominated by D-grade veneer across all six sites. Variation between the E. nitens sites was evident, with recoveries differing between sites reflecting silvicultural treatments. However, only minimal variation in recovery was shown between the E. globulus sites. The presence of similar levels of defects across all E. globulus sites indicates that the intensive silvicultural management at one site studied was not effective in the production of clear wood, and may possibly have adversely affected grade recovery. Veneer value analysis demonstrated only minimal differences between E. globulus sites. More variation was observed in the E. nitens value analysis; however, intensive silvicultural management implemented did not necessarily result in higher veneer value.

Improvement of mango tree architecture

This paper discusses the role of mango canopy architecture in mango productivity and orchard management and considers potential increases on production of high density orchards through improved canopy architecture. Lower tree height, reduced vigour and smaller more open canopies are recognised as important aspects of high density orchards. However, vigour management, light relations, flowering and crop load of high density orchards needs to be better understood if we are to developed sustainable highly productive canopy training and pruning systems that are easy to maintain at high planting densities.

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.

Low Complexity LID using Pruned Pattern Tables of LZW

We present two discriminative language modelling techniques for Lempel-Ziv-Welch (LZW) based LID system. The previous approach to LID using LZW algorithm was to directly use the LZW pattern tables forlanguage modelling. But, since the patterns in a language pattern table are shared by other language pattern tables, confusability prevailed in the LID task. For overcoming this, we present two pruning techniques (i) Language Specific (LS-LZW)-in which patterns common to more than one pattern table are removed. (ii) Length-Frequency product based (LF-LZW)-in which patterns having their length-frequency product below a threshold are removed. These approaches reduce the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score [LZW-WDS]) for non native languages and increases the LID performance considerably. Also the memory and computational requirements of these techniques are much less compared to basic LZW techniques.

Prediction of individual genetic risk to prostate cancer using a polygenic score

BACKGROUND Polygenic risk scores comprising established susceptibility variants have shown to be informative classifiers for several complex diseases including prostate cancer. For prostate cancer it is unknown if inclusion of genetic markers that have so far not been associated with prostate cancer risk at a genome-wide significant level will improve disease prediction. METHODS We built polygenic risk scores in a large training set comprising over 25,000 individuals. Initially 65 established prostate cancer susceptibility variants were selected. After LD pruning additional variants were prioritized based on their association with prostate cancer. Six-fold cross validation was performed to assess genetic risk scores and optimize the number of additional variants to be included. The final model was evaluated in an independent study population including 1,370 cases and 1,239 controls. RESULTS The polygenic risk score with 65 established susceptibility variants provided an area under the curve (AUC) of 0.67. Adding an additional 68 novel variants significantly increased the AUC to 0.68 (P = 0.0012) and the net reclassification index with 0.21 (P = 8.5E-08). All novel variants were located in genomic regions established as associated with prostate cancer risk. CONCLUSIONS Inclusion of additional genetic variants from established prostate cancer susceptibility regions improves disease prediction. Prostate 75:1467–1474, 2015. © 2015 Wiley Periodicals, Inc.

Novel melody line identification algorithm for polyphonic MIDI music

The problem of automatic melody line identification in a MIDI file plays an important role towards taking QBH systems to the next level. We present here, a novel algorithm to identify the melody line in a polyphonic MIDI file. A note pruning and track/channel ranking method is used to identify the melody line. We use results from musicology to derive certain simple heuristics for the note pruning stage. This helps in the robustness of the algorithm, by way of discarding "spurious" notes. A ranking based on the melodic information in each track/channel enables us to choose the melody line accurately. Our algorithm makes no assumption about MIDI performer specific parameters, is simple and achieves an accuracy of 97% in identifying the melody line correctly. This algorithm is currently being used by us in a QBH system built in our lab.

GAP-RBF based NR image quality measurement for JPEG coded images

In this paper, we present a growing and pruning radial basis function based no-reference (NR) image quality model for JPEG-coded images. The quality of the images are estimated without referring to their original images. The features for predicting the perceived image quality are extracted by considering key human visual sensitivity factors such as edge amplitude, edge length, background activity and background luminance. Image quality estimation involves computation of functional relationship between HVS features and subjective test scores. Here, the problem of quality estimation is transformed to a function approximation problem and solved using GAP-RBF network. GAP-RBF network uses sequential learning algorithm to approximate the functional relationship. The computational complexity and memory requirement are less in GAP-RBF algorithm compared to other batch learning algorithms. Also, the GAP-RBF algorithm finds a compact image quality model and does not require retraining when the new image samples are presented. Experimental results prove that the GAP-RBF image quality model does emulate the mean opinion score (MOS). The subjective test results of the proposed metric are compared with JPEG no-reference image quality index as well as full-reference structural similarity image quality index and it is observed to outperform both.

Bayesian Learning for Joint Sparse OFDM Channel Estimation and Data Detection

The impulse response of a typical wireless multipath channel can be modeled as a tapped delay line filter whose non-zero components are sparse relative to the channel delay spread. In this paper, a novel method of estimating such sparse multipath fading channels for OFDM systems is explored. In particular, Sparse Bayesian Learning (SBL) techniques are applied to jointly estimate the sparse channel and its second order statistics, and a new Bayesian Cramer-Rao bound is derived for the SBL algorithm. Further, in the context of OFDM channel estimation, an enhancement to the SBL algorithm is proposed, which uses an Expectation Maximization (EM) framework to jointly estimate the sparse channel, unknown data symbols and the second order statistics of the channel. The EM-SBL algorithm is able to recover the support as well as the channel taps more efficiently, and/or using fewer pilot symbols, than the SBL algorithm. To further improve the performance of the EM-SBL, a threshold-based pruning of the estimated second order statistics that are input to the algorithm is proposed, and its mean square error and symbol error rate performance is illustrated through Monte-Carlo simulations. Thus, the algorithms proposed in this paper are capable of obtaining efficient sparse channel estimates even in the presence of a small number of pilots.

IceCube: efficient targeted mining in data cubes

We address the problem of mining targeted association rules over multidimensional market-basket data. Here, each transaction has, in addition to the set of purchased items, ancillary dimension attributes associated with it. Based on these dimensions, transactions can be visualized as distributed over cells of an n-dimensional cube. In this framework, a targeted association rule is of the form {X -> Y} R, where R is a convex region in the cube and X. Y is a traditional association rule within region R. We first describe the TOARM algorithm, based on classical techniques, for identifying targeted association rules. Then, we discuss the concepts of bottom-up aggregation and cubing, leading to the CellUnion technique. This approach is further extended, using notions of cube-count interleaving and credit-based pruning, to derive the IceCube algorithm. Our experiments demonstrate that IceCube consistently provides the best execution time performance, especially for large and complex data cubes.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Statistical significance of episodes with general partial orders

Frequent episode discovery is one of the methods used for temporal pattern discovery in sequential data. An episode is a partially ordered set of nodes with each node associated with an event type. For more than a decade, algorithms existed for episode discovery only when the associated partial order is total (serial episode) or trivial (parallel episode). Recently, the literature has seen algorithms for discovering episodes with general partial orders. In frequent pattern mining, the threshold beyond which a pattern is inferred to be interesting is typically user-defined and arbitrary. One way of addressing this issue in the pattern mining literature has been based on the framework of statistical hypothesis testing. This paper presents a method of assessing statistical significance of episode patterns with general partial orders. A method is proposed to calculate thresholds, on the non-overlapped frequency, beyond which an episode pattern would be inferred to be statistically significant. The method is first explained for the case of injective episodes with general partial orders. An injective episode is one where event-types are not allowed to repeat. Later it is pointed out how the method can be extended to the class of all episodes. The significance threshold calculations for general partial order episodes proposed here also generalize the existing significance results for serial episodes. Through simulations studies, the usefulness of these statistical thresholds in pruning uninteresting patterns is illustrated. (C) 2014 Elsevier Inc. All rights reserved.