Economic Valuation of Ecosystem Services: Conflicts in Classification

4 p.

Danka Multimedia: Una sociedad cooperativa en expansión en la nueva economía digital

[ES] Danka Multimedia es una sociedad cooperativa que ofrece servicios de comunicación integral en el ámbito de marketing y la formación mediante el uso de las nuevas tecnologías. Por el sector de actividad en el que se encuentra, así como por su propia vocación empresarial, Danka ha experimentado desde sus inicios un proceso paulatino de crecimiento. Este crecimiento está siendo cada más vez progresivo y, por ello, la empresa se está viendo obligada a hacer frente a una serie de problemas derivados del mismo. Estos conflictos derivados del crecimiento, comunes a todo tipo de empresa, se ven acrecentados en el caso de Danka Multimedia por su personalidad jurídica, los valores y cultura que ello conlleva y el sector de actividad en el que desarrolla su actividad. La gestión de este crecimiento, por parte de Danka Multimedia, es el tema central que se aborda a lo largo del caso.

MPI parallel programming of mixed integer optimization problems using CPLEX with COIN-OR

The aim of this technical report is to present some detailed explanations in order to help to understand and use the Message Passing Interface (MPI) parallel programming for solving several mixed integer optimization problems. We have developed a C++ experimental code that uses the IBM ILOG CPLEX optimizer within the COmputational INfrastructure for Operations Research (COIN-OR) and MPI parallel computing for solving the optimization models under UNIX-like systems. The computational experience illustrates how can we solve 44 optimization problems which are asymmetric with respect to the number of integer and continuous variables and the number of constraints. We also report a comparative with the speedup and efficiency of several strategies implemented for some available number of threads.

A Passage to India: from novel to film. Some problems of "translation"

Eguíluz, Federico; Merino, Raquel; Olsen, Vickie; Pajares, Eterio; Santamaría, José Miguel (eds.)

Valuing a Natura 2000 network site to inform land use options using a discrete choice experiment: An illustration from the Basque Country

One of the main problems that public institutions face in the management of protected areas, such as the European Natura 2000 network, is determining how to design and implement sustainable management plans that account for the wide range of marketed and non-marketed benefits they provide to society. This paper presents an application of a stated preference valuation approach aimed at evaluating the social preferences of the population of the Basque Country, Spain, for the key attributes of a regional Natura 2000 network site. According to our results, individuals’ willingness-to-pay (WTP) is higher for attributes associated with non-use values (native tree species and biodiversity conservation) than for attributes associated with use values (agricultural development and commercial forestry). The paper concludes that management policies related to Natura 2000 network sites should account for both for the importance of non-use values and the heterogeneity of the population's preferences in order to minimize potential land use conflicts.

Adaptive Scalable SVD Unit for Fast Processing of Large LSE Problems

Singular Value Decomposition (SVD) is a key linear algebraic operation in many scientific and engineering applications. In particular, many computational intelligence systems rely on machine learning methods involving high dimensionality datasets that have to be fast processed for real-time adaptability. In this paper we describe a practical FPGA (Field Programmable Gate Array) implementation of a SVD processor for accelerating the solution of large LSE problems. The design approach has been comprehensive, from the algorithmic refinement to the numerical analysis to the customization for an efficient hardware realization. The processing scheme rests on an adaptive vector rotation evaluator for error regularization that enhances convergence speed with no penalty on the solution accuracy. The proposed architecture, which follows a data transfer scheme, is scalable and based on the interconnection of simple rotations units, which allows for a trade-off between occupied area and processing acceleration in the final implementation. This permits the SVD processor to be implemented both on low-cost and highend FPGAs, according to the final application requirements.

Problems when generating virtual models representing real objects: Hondarribia walls

[EN] This paper is based in the following project:

La mediación como recurso pedagógico por y para la convivencia pacífica en los centros educativos

Resumen: Los centros educativos son un lugar de convivencia y, como en otros ámbitos de la sociedad, se producen conflictos. Si no se gestionan de manera positiva, éstos pueden afectar a dicha convivencia y para ello, se deben fomentar habilidades sociales específicas como lo es la mediación. Como estructura sistémica, la mediación es una herramienta de trabajo por y para la convivencia pacífica en los centros, en la que los alumnos adquieren un papel protagonista en su propia educación. Así, a través del diálogo los alumnos afrontan los problemas que surgen diariamente, adquiriendo compromisos y responsabilidades, tanto consigo mismo como con los demás; lo que mejora sensiblemente el clima escolar.

A common axiom for classical division rules for claims problems

In this paper we introduce a new axiom, denoted claims separability, that is satisfied by several classical division rules defined for claims problems. We characterize axiomatically the entire family of division rules that satisfy this new axiom. In addition, employing claims separability, we characterize the minimal overlap rule, given by O'Neill (1982), Piniles rule and the rules in the TAL-family, introduced by Moreno-Ternero and Villar (2006), which includes the uniform gains rule, the uniform losses rule and the Talmud rule.

On the optimal usage of labelled examples in semi-supervised multi-class classification problems

In recent years, the performance of semi-supervised learning has been theoretically investigated. However, most of this theoretical development has focussed on binary classification problems. In this paper, we take it a step further by extending the work of Castelli and Cover [1] [2] to the multi-class paradigm. Particularly, we consider the key problem in semi-supervised learning of classifying an unseen instance x into one of K different classes, using a training dataset sampled from a mixture density distribution and composed of l labelled records and u unlabelled examples. Even under the assumption of identifiability of the mixture and having infinite unlabelled examples, labelled records are needed to determine the K decision regions. Therefore, in this paper, we first investigate the minimum number of labelled examples needed to accomplish that task. Then, we propose an optimal multi-class learning algorithm which is a generalisation of the optimal procedure proposed in the literature for binary problems. Finally, we make use of this generalisation to study the probability of error when the binary class constraint is relaxed.

A potential approach to claims problems

Hart and Mas Colell (1989) introduce the potential function for cooperative TU games. In this paper, we extend this approach to claims problems, also known as bankruptcy or rationing problems. We show that for appropriate subproblems, the random arrival rule, the rules in the TAL-family (which include the uniform gains rule, the uniform losses rule and the Talmud rule), the minimal overlap rule, and the proportional rule admit a potential. We also study the balanced contributions property for these rules. By means of a potential, we introduce a generalization of the random arrival rule and mixtures of the minimal overlap rule and the uniform losses rule.

Instances of combinatorial optimization problems: complexity and generation

138 p.

Helmholtz Fermi surface harmonics: an efficient approach for treating anisotropic problems involving Fermi surface integrals

We present a new efficient numerical approach for representing anisotropic physical quantities and/or matrix elements defined on the Fermi surface (FS) of metallic materials. The method introduces a set of numerically calculated generalized orthonormal functions which are the solutions of the Helmholtz equation defined on the FS. Noteworthy, many properties of our proposed basis set are also shared by the FS harmonics introduced by Philip B Allen (1976 Phys. Rev. B 13 1416), proposed to be constructed as polynomials of the cartesian components of the electronic velocity. The main motivation of both approaches is identical, to handle anisotropic problems efficiently. However, in our approach the basis set is defined as the eigenfunctions of a differential operator and several desirable properties are introduced by construction. The method is demonstrated to be very robust in handling problems with any crystal structure or topology of the FS, and the periodicity of the reciprocal space is treated as a boundary condition for our Helmholtz equation. We illustrate the method by analysing the free-electron-like lithium (Li), sodium (Na), copper (Cu), lead (Pb), tungsten (W) and magnesium diboride (MgB2)

Analytical strategies to solve problems in industrial and official laboratories

210 p.