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.

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.

Self-consistent theory of localization in weakly disordered systems

An analytic treatment of localization in a weakly disordered system is presented for the case where the real lattice is approximated by a Cayley tree. Contrary to a recent assertion we find that the mobility edge moves inwards into the band as disorder increases from zero.

The impact of FSC certification on timber tree regeneration and floristic composition in Honduran community forests

Forest certification has been put forward as a means to improve the sustainability of forest management in the tropical countries, where traditional environmental regulation has been inefficient in controlling forest degradation and deforestation. In these countries, the role of communities as managers of the forest resources is rapidly increasing. However, only a fraction of tropical community forests have been certified and little is known about the impacts of certification in these systems. Two areas in Honduras where community-managed forest operations had received FSC certifications were studied. Río Cangrejal represents an area with a longer history of use, whereas Copén is a more recent forest operation. Ecological sustainability was assessed through comparing timber tree regeneration and floristic composition between certified, conventionally managed and natural forests. Data on woody vegetation and environmental conditions was collected within logging gaps and natural treefall gaps. The regeneration success of shade-tolerant timber tree species was lower in certified than in conventionally managed forests in Río Cangrejal. Furthermore, the floristic composition was more natural-like in the conventionally managed than the certified forests. However, the environmental conditions indicated reduced logging disturbance in the certified forests. Data from Copén demonstrated that the regeneration success of light-demanding timber species was higher in the certified than the unlogged forests. In spite of this, the most valuable timber species Swietenia macrophylla was not regenerating successfully in the certified forests, due to rapid gap closure. The results indicate that pre-certification loggings and forest fragmentation may have a stronger impact on forest regeneration than current, certified management practices. The focus in community forests under low-intensive logging should be directed toward landscape connectivity and the restoration of degraded timber species, instead of reducing mechanical logging damage. Such actions are dependent on better recognition of resource rights, and improving the status of small Southern producers in the markets of certified wood products.

An efficient reduction algorithm for computation of interconnect delay variability for statistical timing analysis in clock tree planning

In this paper, we propose a novel and efficient algorithm for modelling sub-65 nm clock interconnect-networks in the presence of process variation. We develop a method for delay analysis of interconnects considering the impact of Gaussian metal process variations. The resistance and capacitance of a distributed RC line are expressed as correlated Gaussian random variables which are then used to compute the standard deviation of delay Probability Distribution Function (PDF) at all nodes in the interconnect network. Main objective is to find delay PDF at a cheaper cost. Convergence of this approach is in probability distribution but not in mean of delay. We validate our approach against SPICE based Monte Carlo simulations while the current method entails significantly lower computational cost.

Productive coexistence and gain in agroforestry systems.

Productive coexistence and coexistence gain of populations were studied using nine years' data from field experiments of Taxodium ascendens-intercrop systems in Lixiahe, Jiangsu Province, China. A theoretical framework for productive coexistence in agroforestry was developed. Interaction patterns between trees and intercrops were presented within this framework. A model framework was developed to describe the coexistence gain and interaction of populations in T. ascendens-intercrop systems. Facilitation and resource sharing were identified as main contribution to the advantage of species combination in agroforestry. The model of population interaction developed in the present study was accepted for describing the interaction of populations in T. ascendens-intercrop systems, because it explained a high proportion of the variance of experimental data and fitted well the observations in most intercropping types. The model developed in the present study provides flexibility for describing different patterns of intra- and inter-specific interactions. Model coefficients were applied to the determination of the ecological compatibility of species. Managed T. ascendens-intercrop systems were advantageous as compared to a monoculture of trees or arable crops. In T. ascendens stands up to the age of three, arable crops contributed about 50-80 % of the total biomass yield of agroforestry. The diameter or height growth of T. ascendens was not significantly influenced by intercrops, indicating that intercropping under trees produced extra yields but did not depress the tree growth. When the trees were young (during the first three years), T. ascendens did not depress the crop yields, and a land equivalent ratio greater than unity was obtained together with a high yield of both components. The diameter and height of the trees were similar in four spacing configurations with an equal number of trees per hectare up to the age of eight, but wider between-rows open range were beneficial for the intercrops. The relationship between open-ranges and species coexistence was also analysed and the distribution of soil nutrients studied.

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

Structured systems methodology for evaluation of random interruptions in continuous process type manufacturing systems

A structured systems methodology was developed to analyse the problems of production interruptions occurring at random intervals in continuous process type manufacturing systems. At a macro level the methodology focuses on identifying suitable investment policies to reduce interruptions of a total manufacturing system that is a combination of several process plants. An interruption-tree-based simulation model was developed for macroanalysis. At a micro level the methodology focuses on finding the effects of alternative configurations of individual process plants on the overall system performance. A Markov simulation model was developed for microlevel analysis. The methodology was tested with an industry-specific application.

Multi-installment load distribution in tree networks with delays

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.

Matching sender and receiver: poikilothermy and frequency tuning in a tree cricket

Animals communicate in non-ideal and noisy conditions. The primary method they use to improve communication efficiency is sender-receiver matching: the receiver's sensory mechanism filters the impinging signal based on the expected signal. In the context of acoustic communication in crickets, such a match is made in the frequency domain. The males broadcast a mate attraction signal, the calling song, in a narrow frequency band centred on the carrier frequency (CF), and the females are most sensitive to sound close to this frequency. In tree crickets, however, the CF changes with temperature. The mechanisms used by female tree crickets to accommodate this change in CF were investigated at the behavioural and biomechanical level. At the behavioural level, female tree crickets were broadly tuned and responded equally to CFs produced within the naturally occurring range of temperatures (18 to 27 degrees C). To allow such a broad response, however, the transduction mechanisms that convert sound into mechanical and then neural signals must also have a broad response. The tympana of the female tree crickets exhibited a frequency response that was even broader than suggested by the behaviour. Their tympana vibrate with equal amplitude to frequencies spanning nearly an order of magnitude. Such a flat frequency response is unusual in biological systems and cannot be modelled as a simple mechanical system. This feature of the tree cricket auditory system not only has interesting implications for mate choice and species isolation but may also prove exciting for bio-mimetic applications such as the design of miniature low frequency microphones.

Geometric Decision Tree

In this paper, we present a new algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess the goodness of hyperplanes at each node while learning a decision tree in top-down fashion. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy for assessing the hyperplanes in such a way that the geometric structure in the data is taken into account. At each node of the decision tree, we find the clustering hyperplanes for both the classes and use their angle bisectors as the split rule at that node. We show through empirical studies that this idea leads to small decision trees and better performance. We also present some analysis to show that the angle bisectors of clustering hyperplanes that we use as the split rules at each node are solutions of an interesting optimization problem and hence argue that this is a principled method of learning a decision tree.

OTCYMIST: Otsu-Canny minimal spanning tree for born-digital images

Text segmentation and localization algorithms are proposed for the born-digital image dataset. Binarization and edge detection are separately carried out on the three colour planes of the image. Connected components (CC's) obtained from the binarized image are thresholded based on their area and aspect ratio. CC's which contain sufficient edge pixels are retained. A novel approach is presented, where the text components are represented as nodes of a graph. Nodes correspond to the centroids of the individual CC's. Long edges are broken from the minimum spanning tree of the graph. Pair wise height ratio is also used to remove likely non-text components. A new minimum spanning tree is created from the remaining nodes. Horizontal grouping is performed on the CC's to generate bounding boxes of text strings. Overlapping bounding boxes are removed using an overlap area threshold. Non-overlapping and minimally overlapping bounding boxes are used for text segmentation. Vertical splitting is applied to generate bounding boxes at the word level. The proposed method is applied on all the images of the test dataset and values of precision, recall and H-mean are obtained using different approaches.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Resilient livelihoods and food security in coastal aquatic agricultural systems: Investing in transformational change

Aquatic agricultural systems (AAS) are diverse production and livelihood systems where families cultivate a range of crops, raise livestock, farm or catch fish, gather fruits and other tree crops, and harness natural resources such as timber, reeds, and wildlife. Aquatic agricultural systems occur along freshwater floodplains, coastal deltas, and inshore marine waters, and are characterized by dependence on seasonal changes in productivity, driven by seasonal variation in rainfall, river flow, and/or coastal and marine processes. Despite this natural productivity, the farming, fishing, and herding communities who live in these systems are among the poorest and most vulnerable in their countries and regions. This report provides an overview of the scale and scope of development challenges in coastal aquatic agricultural systems, their significance for poor and vulnerable communities, and the opportunities for partnership and investment that support efforts of these communities to secure resilient livelihoods in the face of multiple risks.

Problems in estimating the response functions of natural climatic recording systems [abstract]

EXTRACT (SEE PDF FOR FULL ABSTRACT): High-resolution proxy records of climate, such as varves, ice cores, and tree-rings, provide the opportunity for reconstructing climate on a year-by-year basis. In order to do so it is necessary to approximate the complex nonlinear response function of the natural recording system using linear statistical models. Three problems with this approach were discussed, and possible solutions were suggested. Examples were given from a reconstruction of Santa Barbara precipitation based on tree-ring records from Santa Barbara County.