Estudi preliminar per la creació d'una nova categoria d'impacte ambiental dins el marc de l'ACV: la dimensió natural del paisatge

L’Anàlisi de Cicle de Vida (ACV) és una eina emprada per gestionar els impactes ambientals i els recursos usats al llarg del cicle de vida d’un bé o servei. Existeixen reptes de futur en el desenvolupament de l’ACV, tals com la introducció de noves categories d’impacte ambiental, que permetin una anàlisi més específica dels impactes sobre determinats elements del medi, com ara el paisatge. En el present estudi s’analitza la dimensió natural del paisatge per tal de proposar la creació d’un índex de paisatge. Així doncs, s’han revisat les noves propostes de categories d’impacte en ACV que inclouen directament o indirecta el paisatge i s’ha analitzat una mostra de 33 estudis d’indicadors de paisatge. Aquesta cerca deriva en l’elecció de 6 indicadors: els usos del sòl, la diversitat paisatgística, la fragmentació, la connectivitat, la riquesa d’espècies i la densitat de carreteres. En la determinació dels seus respectius mètodes de càlcul s’ha detectat la importància de l’ús dels SIG, l’elecció d’una base de dades d’usos del sòl comuna (CORINE) i les interrelacions que existeixen entre indicadors. La proposta de l’índex hauria de poder ésser un punt de partida per a futurs estudis en aquest àmbit i derivar en una nova categoria d’impacte de paisatge, donat que caldrà estudiar alguns elements, com la interrelació entre indicadors.

What is what?: A simple time-domain test of long-memory vs. structural breaks

This paper proposes a new time-domain test of a process being I(d), 0 < d = 1, under the null, against the alternative of being I(0) with deterministic components subject to structural breaks at known or unknown dates, with the goal of disentangling the existing identification issue between long-memory and structural breaks. Denoting by AB(t) the different types of structural breaks in the deterministic components of a time series considered by Perron (1989), the test statistic proposed here is based on the t-ratio (or the infimum of a sequence of t-ratios) of the estimated coefficient on yt-1 in an OLS regression of ?dyt on a simple transformation of the above-mentioned deterministic components and yt-1, possibly augmented by a suitable number of lags of ?dyt to account for serial correlation in the error terms. The case where d = 1 coincides with the Perron (1989) or the Zivot and Andrews (1992) approaches if the break date is known or unknown, respectively. The statistic is labelled as the SB-FDF (Structural Break-Fractional Dickey- Fuller) test, since it is based on the same principles as the well-known Dickey-Fuller unit root test. Both its asymptotic behavior and finite sample properties are analyzed, and two empirical applications are provided.

Alloy inhomogeneities in InAlAs strained layers grown by MBE

Transmission electron microscopy studies have been performed to characterize InxAl1−xAs layers grown by molecular beam epitaxy on (100) InP substrates. The first observations of compositional nonuniformities in strained InAlAs layers are reported. The coarse quasiperiodic structure present in each sample has been found to be dependent upon the growth parameters and the sample characteristics.

Análisis de las incoherencias entre texto e imagen en Los Simpson

En los productos audiovisuales, el canal oral y el visual transmiten información simultáneamente. Si la coherencia de sentido entre texto e imagen desaparece en el doblaje, el objetivo de verosimilitud no se satisface. En este trabajo analizo y clasifico las incoherencias texto-imagen y aporto posibles soluciones a este recurrente problema.

Evolution based on domain combinations: the case of glutaredoxins

Background: Protein domains represent the basic units in the evolution of proteins. Domain duplication and shuffling by recombination and fusion, followed by divergence are the most common mechanisms in this process. Such domain fusion and recombination events are predicted to occur only once for a given multidomain architecture. However, other scenarios may be relevant in the evolution of specific proteins, such as convergent evolution of multidomain architectures. With this in mind, we study glutaredoxin (GRX) domains, because these domains of approximately one hundred amino acids are widespread in archaea, bacteria and eukaryotes and participate in fusion proteins. GRXs are responsible for the reduction of protein disulfides or glutathione-protein mixed disulfides and are involved in cellular redox regulation, although their specific roles and targets are often unclear. Results: In this work we analyze the distribution and evolution of GRX proteins in archaea,bacteria and eukaryotes. We study over one thousand GRX proteins, each containing at least one GRX domain, from hundreds of different organisms and trace the origin and evolution of the GRX domain within the tree of life. Conclusion: Our results suggest that single domain GRX proteins of the CGFS and CPYC classes have, each, evolved through duplication and divergence from one initial gene that was present in the last common ancestor of all organisms. Remarkably, we identify a case of convergent evolution in domain architecture that involves the GRX domain. Two independent recombination events of a TRX domain to a GRX domain are likely to have occurred, which is an exception to the dominant mechanism of domain architecture evolution.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Estimating extreme value cumulative distribution functions using bias-corrected kernel approaches

We propose a new kernel estimation of the cumulative distribution function based on transformation and on bias reducing techniques. We derive the optimal bandwidth that minimises the asymptotic integrated mean squared error. The simulation results show that our proposed kernel estimation improves alternative approaches when the variable has an extreme value distribution with heavy tail and the sample size is small.

Fair value versus historical cost-based valuation for biological assets: Predictability of financial information

There is an intense debate on the convenience of moving from historical cost (HC) toward the fair value (FV) principle. The debate and academic research is usually concerned with financial instruments, but the IAS 41 requirement of fair valuation for biological assets brings it into the agricultural domain. This paper performs an empirical study with a sample of Spanish farms valuing biological assets at HC and a sample applying FV, finding no significant differences between both valuation methods to assess future cash flows. However, most tests reveal more predictive power of future earnings under fair valuation of biological assets, which is not explained by differences in volatility of earnings and profitability. The study also evidences the existence of flawed HC accounting practices for biological assets in agriculture, which suggests scarce information content of this valuation method in the predominant small business units existing in the agricultural sector in advanced Western countries