16 resultados para Methodological problems
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
Resumo:
[EN] The goal of this contribution is twofold: on the one hand, to review two relatively recent contributions in the field of Eskimo-Aleut historical linguistics in which it is proposed that Eskimo-Aleut languages are related genealogically to Wakashan (Holst 2004) and?/or Nostratic (Krougly-Enke 2008). These contributions can be characterized by saying that their authors have taken little care to be diligent and responsible in the application of the comparative method, and that their familiarity with the languages involved is insufficient. Eskimo-Aleut languages belong to a very exclusive group of language families that have been (and still are) used, sometimes compulsively, in the business of so-called “long-range comparisons”. Those carrying out such studies are very often unaware of the most basic facts regarding the philological and linguistic traditions of those languages, as a result of what mountains of very low quality works with almost no-relevancy for the specialist grow every year to the desperation of the scientific community, whose attitude toward them ranges from the most profound indifference to the toughest (and most explicit) critical tone. Since Basque also belongs to this group of “compare-with-everything-you-come- across” languages, it is my intention to provide the Basque readership with a sort of “pedagogical case” to show that little known languages, far from underrepresented in the field, already have a very long tradition in historical and comparative linguistics, i.e. nobody can approach them without previous acquaintance with the materials. Studies dealing with the methodological inappropriateness of the Moscow School’s Nostratic hypothesis or the incorrectness of many of the proposed new taxonomic Amerindian subfamilies (several of them involving the aforementioned Wakashan languages), that is to say, the frameworks on which Krougly-Enke and Holst work, respectively, are plenty (i.a. Campbell 1997: 260-329, Campbell & Poser 2008: 234-96), therefore there is no reason to insist once more on the very same point. This is the reason why I will not discuss per se Eskimo-Aleut–Wakashan or Eskimo-Aleut–Nostratic. On the contrary, I will focus attention upon very concrete aspects of Krougly-Enke and Holst´s proposals, i.e. when they work on “less ambitious” problems, for example, dealing with the minutiae of internal facts or analyzing certain words from the sole perspective of Eskimo-Aleut materials (in other words, those cases in which even they do not invoke the ad hoc help of Nostratic stuff). I will try to explain why some of their proposals are wrong, demonstrate where the problem lies, and fix it if possible. In doing so, I will propose new etymologies in an attempt at showing how we may proceed. The main difference between this and handbook examples lies in the reality of what we are doing: this is a pure etymological exercise from beginning to end. I will try to throw a bit of light on a couple of problematic questions regarding Aleut historical phonology, demonstrating how much work should be done at the lowest level of the Eskimo-Aleut pyramid; it is technically impossible to reach the peak of the pyramid without having completed the base. As far as Aleut is regarded, I will mainly profit not only from the use of the traditional philological analysis of Aleut (and, eventually, of Eskimo) materials, but also of diachronic typology, bringing into discussion what in my opinion seems useful, and in some cases I think decisive, parallels. It is worth noting that this paper makes up yet another part of a series of exploratory works dealing with etymological aspects of the reconstruction of Proto-Eskimo-Aleut, with special emphasis on Aleut (vid. i.a. Alonso de la Fuente 2006/2007, 2008a, 2008b, 2010a), whose main goal is to become the solid basis for an etymological dictionary of the Aleut language, currently in progress.
Resumo:
Contributed to: Fusion of Cultures. XXXVIII Annual Conference on Computer Applications and Quantitative Methods in Archaeology – CAA2010 (Granada, Spain, Apr 6-9, 2010)
Resumo:
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.
Resumo:
Eguíluz, Federico; Merino, Raquel; Olsen, Vickie; Pajares, Eterio; Santamaría, José Miguel (eds.)
Resumo:
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.
Resumo:
[EN] This paper is based in the following project:
Resumo:
31 p.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
138 p.
Resumo:
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)
Resumo:
Editores:Micaela Muñoz-Calvo; Carmen Buesa-Gómez
Resumo:
549 pp. (Bibliogr. pp. 501-522) (Conclusiones pp. 467-483/ Conclusions pp. 484-497)