Analytical strategies to solve problems in industrial and official laboratories

210 p.

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.

Distribution of Healthcare resources II.Study and Comparison of a Linear Programming Problem and its Dual. Resolution and Evaluation of a Practical Case and its Programming using Excel and Win QSB.

[EN]This research had as primary objective to model different types of problems using linear programming and apply different methods so as to find an adequate solution to them. To achieve this objective, a linear programming problem and its dual were studied and compared. For that, linear programming techniques were provided and an introduction of the duality theory was given, analyzing the dual problem and the duality theorems. Then, a general economic interpretation was given and different optimal dual variables like shadow prices were studied through the next practical case: An aesthetic surgery hospital wanted to organize its monthly waiting list of four types of surgeries to maximize its daily income. To solve this practical case, we modelled the linear programming problem following the relationships between the primal problem and its dual. Additionally, we solved the dual problem graphically, and then we found the optimal solution of the practical case posed through its dual, following the different theorems of the duality theory. Moreover, how Complementary Slackness can help to solve linear programming problems was studied. To facilitate the solution Solver application of Excel and Win QSB programme were used.

The Ohlin-Keynes Debate on the German Interwar Reparations Revisited

This paper analyzes the debate between Ohlin and Keynes on the question as to whether Germany was able to make the payments specified in the Dawes Plan. Keynes argued that Germany was able to collect the money but unable to transfer it to the victors because there existed an insurmountable “transfer problem”. Ohlin replied that such a “transfer problem” did not exist and, therefore, that Germany was able to make the payments stipulated by the Dawes Committee. This paper analyzes the positions of the two contenders and argues that the problems are not correctly delimited and that the theoretical bases of the contenders show serious deficiencies. It also brings to light some interesting theoretical and practical paradoxes that neither Keynes nor Ohlin dealt with.

Lowndes and Locke on the value of money

This paper was presented at the 11th Annual Conference of the European Society for the History of Economic Thought (ESHET).

Practical applications of the likelihood, time transcendence and metadata in virtual models of heritage elements

Contributed to: III Bienal de Restauración Monumental: "Sobre la des-restauración" (Sevilla, Spain, Nov 23-25, 2006)

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.

Avances en algoritmos de estimación de distribuciones. Alternativas en el aprendizaje y representación de problemas

131 p.: graf.

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.)