Forward-looking versus recursive-dynamic modeling in climate policy analysis: A comparison

This paper develops a multi-regional general equilibrium model for climate policy analysis based on the latest version of the MIT Emissions Prediction and Policy Analysis (EPPA) model. We develop two versions so that we can solve the model either as a fully inter-temporal optimization problem (forward-looking, perfect foresight) or recursively. The standard EPPA model on which these models are based is solved recursively, and it is necessary to simplify some aspects of it to make inter-temporal solution possible. The forward-looking capability allows one to better address economic and policy issues such as borrowing and banking of GHG allowances, efficiency implications of environmental tax recycling, endogenous depletion of fossil resources, international capital flows, and optimal emissions abatement paths among others. To evaluate the solution approaches, we benchmark each version to the same macroeconomic path, and then compare the behavior of the two versions under a climate policy that restricts greenhouse gas emissions. We find that the energy sector and CO(2) price behavior are similar in both versions (in the recursive version of the model we force the inter-temporal theoretical efficiency result that abatement through time should be allocated such that the CO(2) price rises at the interest rate.) The main difference that arises is that the macroeconomic costs are substantially lower in the forward-looking version of the model, since it allows consumption shifting as an additional avenue of adjustment to the policy. On the other hand, the simplifications required for solving the model as an optimization problem, such as dropping the full vintaging of the capital stock and fewer explicit technological options, likely have effects on the results. Moreover, inter-temporal optimization with perfect foresight poorly represents the real economy where agents face high levels of uncertainty that likely lead to higher costs than if they knew the future with certainty. We conclude that while the forward-looking model has value for some problems, the recursive model produces similar behavior in the energy sector and provides greater flexibility in the details of the system that can be represented. (C) 2009 Elsevier B.V. All rights reserved.

Lanczos subspace filter diagonalization: Homogeneous recursive filtering and a low-storage method for the calculation of matrix elements

We develop a new iterative filter diagonalization (FD) scheme based on Lanczos subspaces and demonstrate its application to the calculation of bound-state and resonance eigenvalues. The new scheme combines the Lanczos three-term vector recursion for the generation of a tridiagonal representation of the Hamiltonian with a three-term scalar recursion to generate filtered states within the Lanczos representation. Eigenstates in the energy windows of interest can then be obtained by solving a small generalized eigenvalue problem in the subspace spanned by the filtered states. The scalar filtering recursion is based on the homogeneous eigenvalue equation of the tridiagonal representation of the Hamiltonian, and is simpler and more efficient than our previous quasi-minimum-residual filter diagonalization (QMRFD) scheme (H. G. Yu and S. C. Smith, Chem. Phys. Lett., 1998, 283, 69), which was based on solving for the action of the Green operator via an inhomogeneous equation. A low-storage method for the construction of Hamiltonian and overlap matrix elements in the filtered-basis representation is devised, in which contributions to the matrix elements are computed simultaneously as the recursion proceeds, allowing coefficients of the filtered states to be discarded once their contribution has been evaluated. Application to the HO2 system shows that the new scheme is highly efficient and can generate eigenvalues with the same numerical accuracy as the basic Lanczos algorithm.

Simulating growth, development, and yield of tillering pearl millet. III. Biomass accumulation and partitioning

Pearl millet landraces from Rajasthan, India, yield significantly less than improved cultivars under optimum growing conditions, but not under stressed conditions. To successfully develop a simulation model for pearl millet, capable of capturing such genotype x environment (G x E) interactions for grain yield, we need to understand the causes of the observed yield interaction. The aim of this paper is to quantify the key parameters that determine the accumulation and partitioning of biomass: the,light extinction coefficient, radiation use efficiency (RUE), pattern of dry matter allocation to the leaf blades, the determination of grain number, and the rate and duration of dry matter accumulation into individual grains. We used data on improved cultivars and landraces, obtained from both published and unpublished sources collected at ICRISAT, Patancheru, India. Where possible, the effects of cultivar and axis (main shoot vs. tillers) on these parameters were analysed, as previous research suggested that G x E interactions for grain yield are associated with differences in tillering habit. Our results indicated there were no cultivar differences in extinction coefficient, RUE, and biomass partitioning before anthesis, and differences between axes in biomass partitioning were negligible. This indicates there was no basis for cultivar differences in the potential grain yield. Landraces, however, produced consistently less grain yield for a given rate of dry matter accumulation at anthesis than did improved cultivars. This was caused by a combination of low grain number and small grain size. The latter was predominantly due to a lower grain growth rate, as genotypic differences in the duration of grain filling were relatively small. Main shoot and tillers also had a similar duration of grain filling. The low grain yield of the landraces was associated with profuse nodal tillering, supporting the hypothesis that grain yield was below the potential yield that could be supported by assimilate availability. We hypothesise this is a survival strategy, which enhances the prospects to escape the effects of stress around anthesis. (C) 2002 E.J. van Oosterom. Published by Elsevier Science B.V. All rights reserved.

Partitioning sets of triples into small planes

We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2, 2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions) or copies of some planes of each type (mixed partitions). We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in several cases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We construct such partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, and an affine partition for v = 18. Using these as starter partitions, we prove that Fano partitions exist for v = 7(n) + 1, 13(n) + 1, 27(n) + 1, and affine partitions for v = 8(n) + 1, 9(n) + 1, 17(n) + 1. In particular, both Fano and affine partitions exist for v = 3(6n) + 1. Using properties of 3-wise balanced designs, we extend these results to show that affine partitions also exist for v = 3(2n). Similarly, mixed partitions are shown to exist for v = 8(n), 9(n), 11(n) + 1.

Predicting plant leaf area production: shoot assimilate accumulation and partitioning, and leaf area ratio, are stable for a wide range of sorghum population densities

Predicting plant leaf area production is required for modelling carbon balance and tiller dynamics in plant canopies. Plant leaf area production can be studied using a framework based on radiation intercepted, radiation use efficiency (RUE) and leaf area ratio (LAR) (ratio of leaf area to net above-ground biomass). The objective of this study was to test this framework for predicting leaf area production of sorghum during vegetative development by examining the stability of the contributing components over a large range of plant density. Four densities, varying from 2 to 16 plants m(-2), were implemented in a field experiment. Plants were either allowed to tiller or were maintained as uniculm by systematic tiller removal. In all cases, intercepted radiation was recorded daily and leaf area and shoot dry matter partitioning were quantified weekly at individual culm level. Up to anthesis, a unique relationship applied between fraction of intercepted radiation and leaf area index, and between shoot dry weight accumulation and amount of intercepted radiation, regardless of plant density. Partitioning of shoot assimilate between leaf, stem and head was also common across treatments up to anthesis, at both plant and culm levels. The relationship with thermal time (TT) from emergence of specific leaf area (SLA) and LAR of tillering plants did not change with plant density. In contrast, SLA of uniculm plants was appreciably lower under low-density conditions at any given TT from emergence. This was interpreted as a consequence of assimilate surplus arising from the inability of the plant to compensate by increasing the leaf area a culm could produce. It is argued that the stability of the extinction coefficient, RUE and plant LAR of tillering plants observed in these conditions provides a reliable way to predict leaf area production regardless of plant density. Crown Copyright (C) 2002 Published by Elsevier Science B.V. All rights reserved.

Explicit/implicit partitioning and a new explicit form of the generalized alpha method

Most finite element packages use the Newmark algorithm for time integration of structural dynamics. Various algorithms have been proposed to better optimize the high frequency dissipation of this algorithm. Hulbert and Chung proposed both implicit and explicit forms of the generalized alpha method. The algorithms optimize high frequency dissipation effectively, and despite recent work on algorithms that possess momentum conserving/energy dissipative properties in a non-linear context, the generalized alpha method remains an efficient way to solve many problems, especially with adaptive timestep control. However, the implicit and explicit algorithms use incompatible parameter sets and cannot be used together in a spatial partition, whereas this can be done for the Newmark algorithm, as Hughes and Liu demonstrated, and for the HHT-alpha algorithm developed from it. The present paper shows that the explicit generalized alpha method can be rewritten so that it becomes compatible with the implicit form. All four algorithmic parameters can be matched between the explicit and implicit forms. An element interface between implicit and explicit partitions can then be used, analogous to that devised by Hughes and Liu to extend the Newmark method. The stability of the explicit/implicit algorithm is examined in a linear context and found to exceed that of the explicit partition. The element partition is significantly less dissipative of intermediate frequencies than one using the HHT-alpha method. The explicit algorithm can also be rewritten so that the discrete equation of motion evaluates forces from displacements and velocities found at the predicted mid-point of a cycle. Copyright (C) 2003 John Wiley Sons, Ltd.

Partitioning taxon, phylogenetic and functional beta diversity into replacement and richness difference components

Copyright © 2013 John Wiley & Sons Ltd.

Energy-conscious tasks partitioning onto a heterogeneous multi-core platform

Modern multicore processors for the embedded market are often heterogeneous in nature. One feature often available are multiple sleep states with varying transition cost for entering and leaving said sleep states. This research effort explores the energy efficient task-mapping on such a heterogeneous multicore platform to reduce overall energy consumption of the system. This is performed in the context of a partitioned scheduling approach and a very realistic power model, which improves over some of the simplifying assumptions often made in the state-of-the-art. The developed heuristic consists of two phases, in the first phase, tasks are allocated to minimise their active energy consumption, while the second phase trades off a higher active energy consumption for an increased ability to exploit savings through more efficient sleep states. Extensive simulations demonstrate the effectiveness of the approach.

A recursive process related to a partisan variation of Wythoff

Wythoff Queens is a classical combinatorial game related to very interesting mathematical results. An amazing one is the fact that the P-positions are given by (⌊├ φn⌋┤┤,├ ├ ⌊φ┤^2 n⌋) and (⌊├ φ^2 n⌋┤┤,├ ├ ⌊φ┤n⌋) where φ=(1+√5)/2. In this paper, we analyze a different version where one player (Left) plays with a chess bishop and the other (Right) plays with a chess knight. The new game (call it Chessfights) lacks a Beatty sequence structure in the P-positions as in Wythoff Queens. However, it is possible to formulate and prove some general results of a general recursive law which is a particular case of a Partizan Subtraction game.

Partitioning the Network-on-Chip to Enable Virtualization on Many-Core Processors

6th International Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.

Task partitioning and priority assignment for distributed hard real-time systems

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

Recursive neuro fuzzy techniques for online identification and control

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Preliminary study of the acoustic behavior concerning an innovative prototype for indoor modular partitioning

This paper presents a preliminary acoustic study concerning the development of the first prototype of a patented removable module for interior partitioning. It is a prefabricated, vertical element for division of interior spaces that does not require the use of gutters or technical support. A set of such modules, linearly disposed, will create a division, allowing the personalization of any indoor area, including open office spaces, rooms, among others. The main characteristic that distinguishes this element from the existing solutions available on the market is that its mobility relies exclusively on a set of integrated bearings at the base of each module. Through an incorporated elevation system, the user can lower the module, move it to the desired position and re-elevate it until pressed against the ledge of the ceiling, making it stable. In this sense, and taking into account its acoustic behavior, several tests were made in the LNEC acoustics lab. Airborne sound insulation tests for different typologies of the prototype were conducted, according to the applicable standards EN ISO 354:2003, EN ISO 717-1:2013 and EN ISO 10140-2:2010. Some important conclusions and analysis of the prototype viability were extracted.

Resource partitioning and ecomorphological variation in two syntopic species of Lebiasinidae (Characiformes) in an Amazonian stream

ABSTRACTResource partitioning is important for species coexistence. Species with similar ecomorphology are potential competitors, especially when phylogenetically close, due to niche conservatism. The aim of this study was to investigate the resource partitioning among populations of two species of lebiasinids (Copella nigrofasciata and Pyrrhulina aff. brevis) that co-occur in a first-order Amazonian stream, analyzing the trophic ecology, feeding strategies and ecomorphological attributes related to the use of food and space by these species. Fish were captured in May and September 2010. The stomach contents of 60 individuals were analyzed and quantified volumetrically to characterize the feeding ecology of both species. Eleven morphological attributes were measured in 20 specimens and combined in nine ecomorphological indices. Both species had an omnivorous-invertivorous diet and consumed predominantly allochthonous items. Both showed a tendency to a generalist diet, but intrapopulational variation in resource use was also detected. Overall feeding niche overlap was high, but differed between seasons: low during the rainy season and high in the dry season. In the latter, the food niche overlap was asymmetric because C. nigrofasciata consumed several prey of P. aff. brevis, which reduced its food spectrum. The ecomorphological analysis suggests that C. nigrofasciatahas greater swimming capacity (greater relative length of caudal peduncle) than P. aff. brevis, which has greater maneuverability and tendency to inhabit lentic environments (greater relative depth of the body). Our results demonstrate that these species have similar trophic ecology and suggest a spatial segregation, given by morphological differences related to locomotion and occupation of habitat, favoring their coexistence.