El regadío en al-Andalus: problemas en torno a su estudio.

Sin resume

GPS transmitter implemententation through a Software Defined Radio Platform

The current project consists in a simple GPS transmission system design that imitate a satellite one and it is based on LabVIEW. Moreover, this technology objectives are related to education and it offers a required introduction about the Global Positioning System in order to understand all the variables that are sent by the transmitter in the GPS packet. The platform permits the configuration of the GPS messages and simulation, taking into account a receptor developed that has been developed at the same time. The tool objective is to be an test-bench and an intuitive and easy to use demonstration tool. It will be seen that this project is very interesting in terms of specific education and even for students with a little curriculum in order to understand the protocol and grow in some important skills as critical thinking and decision-making. It will be seen also that a GPS satellite can be done with LabVIEW’s USRP technology in some way.El presente proyecto consiste en el diseño de un sistema de transmisión GPS simple (imitando uno satelital, pero limitándolo) usando LabVIEW. Además, esta tecnología cuyos fines están relacionados con la educación ofrece una necesaria introducción al Sistema de Posicionamiento Global en pos de la comprensión de los parámetros mandados por el transmisor en el mensaje GPS. La plataforma permite la configuración de mensajes GPS y la simulación, a vista de un receptor preparado. La herramienta busca ser un área de pruebas y demostraciones de uso fácil e intuitivo para el usuario. Se podrá observar que éste es un proyecto interesante en términos tanto de educacion específica como para estudiantes con una base educacional más baja pues permite entender bien el protodolo e incluso desarrollar capacidades en pensamiento crítico o en toma de decisiones. Se podrá ver, finalmente, que, de alguna forma, se puede desarrollar un satélite GPS a partir de la tecnología USRP de LabVIEW.Ingeniería en Tecnologías de Telecomunicació

Assessing the mapping of quantum algorithms on superconducting quantum processors

Quantum computing is a promising field regarding computation capabilities for several important tasks. One of the most promising solid-state quantum technology, which is being developed at Qutech (TU Delft), is superconducting qubits. In superconducting quantum processors, qubits are arranged along a 2D grid that only permits information transmission between adjacent qubits. In order to run a quantum algorithm on such a processor a mapping strategy of scheduling-placement-routing is needed.Quantum computers hold the promise for solving efficiently important problems in computational sciences that are intractable nowadays by exploiting quantum phenomena such are superposition and entanglement. Research in quantum computing is mainly driven by the development of quantum devices and quantum algorithms. Quantum algorithms can be described by quantum circuits, which are hardware agnostic -- e.g it is assumed that any arbitrary interaction between qubits is possible. However, real quantum processors have a series of constraints that must be complied to when running a quantum algorithm. Therefore, a mapping process that adapts the quantum circuit to chip's constraints is required. The mapping process will, in general, increase the number of gates and/or the circuit depth. As qubits and gates are error prone, it will result in an increment of the failure rate of computation while running the adapted quantum algorithm in a given quantum device. Most of the current mapping models optimize and are assessed based on two metrics: circuit depth (or latency) and number of (movement) operations added; they should be as minimal as possible. However, these metrics are not giving any information about how the mapping process is affecting the reliability of the algorithm. In other words, can still the algorithm produce `good' results after being mapped? The aim of this thesis is to propose some new mapping metrics that allow to study the impact of the mapping process on the algorithm's reliability. These are, quantum fidelity, probability of success of the algorithm and quantum volume. They could be used not only to assess the quality of the mapping procedure but also as parameters to be optimized by the mapping. To this purpose, different quantum algorithms have been mapped into the superconducting quantum processor, called Surface-17, developed at QuTech

Peanut Shell for Energy: Properties and Its Potential to Respect the Environment

The peanut (Arachys hypogaea) is a plant of the Fabaceae family (legumes), as are chickpeas, lentils, beans, and peas. It is originally from South America and is used mainly for culinary purposes, in confectionery products, or as a nut as well as for the production of biscuits, breads, sweets, cereals, and salads. Also, due to its high percentage of fat, peanuts are used for industrialized products such as oils, flours, inks, creams, lipsticks, etc. According to the Food and Agriculture Organization (FAO) statistical yearbook in 2016, the production of peanuts was 43,982,066 t, produced in 27,660,802 hectares. Peanuts are grown mainly in Asia, with a global production rate of 65.3%, followed by Africa with 26.2%, the Americas with 8.4%, and Oceania with 0.1%. The peanut industry is one of the main generators of agroindustrial waste (shells). This residual biomass (25–30% of the total weight) has a high energy content that is worth exploring. The main objectives of this study are, firstly, to evaluate the energy parameters of peanut shells as a possible solid biofuel applied as an energy source in residential and industrial heating installations. Secondly, different models are analysed to estimate the higher heating value (HHV) for biomass proposed by different scientists and to determine which most accurately fits the determination of this value for peanut shells. Thirdly, we evaluate the reduction in global CO2 emissions that would result from the use of peanut shells as biofuel. The obtained HHV of peanut shells (18.547 MJ/kg) is higher than other biomass sources evaluated, such as olive stones (17.884 MJ/kg) or almond shells (18.200 MJ/kg), and similar to other sources of biomass used at present for home and industrial heating applications. Different prediction models of the HHV value proposed by scientists for different types of biomass have been analysed and the one that best fits the calculation for the peanut shell has been determined. The CO2 reduction that would result from the use of peanut shells as an energy source has been evaluated in all production countries, obtaining values above 0.5 ‰ of their total emissions

Argumentos ontológicos

In this paper we propose a deep revisten of the classical ontological arguments of Anselm, Descartes, Leibniz and Spinoza. The introduction c1arifies the concept of ontological argument and point out the important logic distinction between the validity of an argument and its soundness, where besides validity it is required that all premises are actually true. The following sections discuss in turn the arguments of Anselm, Descartes, Spinoza and Leibniz. In all cases we have translated the relevant passages of the original argument and formalized its hypothesis and conclusion. In some cases we reconstructed the whole argument and added as hypothesis all statements that served the authors to prove their thesis. By doing this we detached ourselves from what is traditionally considered the argument (for example, as seen in Logic and Theism [Sobel]) and most of the arguments become formally valid.We are aware of the fact that in this way we made explicit the hidden assumptions that made the argument valid while weakening its strength. The reason why is that the new hypothesis are hard to justify as in many cases they have philosophical import and they even committed the fallacy known as petitio principii. Very often the new hypothesis are existential statements, which c1early allow passing from a definition, which simply establishes a correspondence between properties, to an assumption of consistency, stating that certain sets are not empty. The paper includes the issues relevant to this study: the consideration of existence as a predicate, improper descriptions, existential import of universal statements, modal categories and the eventual modal collapse. We should highlight the effort of formalization for which we have used several logics: classical first order logic, higher order (with a description operator) and modal logic. We conclude by pointing out that the subject of ontological arguments still fascinate logicians and philosophers and received attention in the twentieth and the twenty first century.En este artículo proponemos una revisión a fondo de los argumentos ontológicos clásicos: de Anselmo, Descartes, Spinoza y Leibniz. En la introducción se precisa la noción de argumento ontológico y señalamos la importante distinción que hacemos en lógica entre la validez de un argumento y su solidez, esta última tiene en cuenta no sólo la corrección formal del mismo sino también la verdad de las hipótesis. En las siguientes secciones se analizanpor turno los argumentos de Anselmo, Descartes, Spinoza y Leibniz. En todos los casos hemos traducido los pasajes correspondientes del argumento original y formalizado sushipótesis y conclusión. En algunos casos hemos reconstruido el argumento y destacado como hipótesis todos los enunciados que de hecho se usan en la demostración por parte de los autores en estudio. De esta forma a veces nos separamos de lo que tradicionalmente es considerado el argumento (por ejemplo, tal y como se presentan en Logic and Theism [Sobel]) y la mayor parte de los argumentos deviene en formalmente válidos. Somos conscientes de que de esa manera hemos explicitado las premisas ocultas que validan el argumento pero a la vez disminuyen la solidez del mismo por tratarse de hipótesis de dificil justificación y con carga filosófica en muchos casos, incluso de falacias de petición de principio. Frecuentemente se trata de hipótesis existenciales, que claramente permiten pasar de una definición, que simplemente establece una correspondencia entre propiedades, a una asunción de consistencia, estableciendo que no son vacíos ciertos conjuntos. Se mencionan los temas relevantes a este estudio: el de la consideración de la existencia como un predicado, el de las descripciones impropias, el compromiso o aporte existencial de los enunciados universales, las categorías modales y el eventual colapso modal. Habría que destacar el esfuerzo de formalización para la que hemos empleado varias lógicas: clásica de primer, de orden superior (con descriptores como operadores lógicos) y lógica modal. Finalizamos señalando que el tema de los argumentos ontológicos sigue fascinando a los lógicos y filósofos, recibió mucha atención en el siglo XX y también en el XXI

Identity, Equality, Nameability and Completeness

This article is an extended promenade strolling along the winding roads of identity, equality, nameability and completeness, looking for places where they converge. We have distinguished between identity and equality; the first is a binary relation between objects while the second is a symbolic relation between terms. Owing to the central role the notion of identity plays in logic, you can be interested either in how to define it using other logical concepts or in the opposite scheme. In the first case, one investigates what kind of logic is required. In the second case, one is interested in the definition of the other logical concepts (connectives and quantifiers) in terms of the identity relation, using also abstraction. The present paper investigates whether identity can be introduced by definition arriving to the conclusion that only in full higher-order logic a reliable definition of identity is possible. However, the definition needs the standard semantics and we know that with this semantics completeness is lost. We have also studied the relationship of equality with comprehension and extensionality and pointed out the relevant role played by these two axioms in Henkin’s completeness method. We finish our paper with a section devoted to general semantics, where the role played by the nameable hierarchy of types is the key in Henkin’s completeness method

Fir system identification using a linear combination of cumulants

A general linear approach to identifying the parameters of a moving average (MA) model from the statistics of the output is developed. It is shown that, under some constraints, the impulse response of the system can be expressed as a linear combination of cumulant slices. This result is then used to obtain a new well-conditioned linear method to estimate the MA parameters of a nonGaussian process. The proposed approach does not require a previous estimation of the filter order. Simulation results show improvement in performance with respect to existing methods.Peer ReviewedPostprint (published version

Identity, equality, nameability and completeness. Part II

This article is a continuation of our promenade along the winding roads of identity, equality, nameability and completeness. We continue looking for a place where all these concepts converge. We assume that identity is a binary relation between objects while equality is a symbolic relation between terms. Identity plays a central role in logic and we have looked at it from two different points of view. In one case, identity is a notion which has to be defined and, in the other case, identity is a notion used to define other logical concepts. In our previous paper, [16], we investigated whether identity can be introduced by definition arriving to the conclusion that only in full higher-order logic with standard semantics a reliable definition of identity is possible. In the present study we have moved to modal logic and realized that here we can distinguish in the formal language between two different equality symbols, the first one shall be interpreted as extensional genuine identity and only applies for objects, the second one applies for non rigid terms and has the characteristic of synonymy. We have also analyzed the hybrid modal logic where we can introduce rigid terms by definition and can express that two worlds are identical by using the nominals and the @ operator. We finish our paper in the kingdom of identity where the only primitives are lambda and equality. Here we show how other logical concepts can be defined in terms of the identity relation. We have found at the end of our walk a possible point of convergence in the logic Equational Hybrid Propositional Type Theory (EHPTT), [14] and [15].This research has been possible thanks to the research projects sustained by Ministerio de Econom´ıa y Competitividad of Spain with references FFI2013-47126-P and FFI2017-82554-