Search results for "table"
showing 10 items of 2807 documents
ASSESSING FAO-56 MODEL TO ESTIMATE TABLE OLIVE WATER CONSUME UNDER SOIL WATER DEFICIT CONDITIONS
2012
Agro-hydrological models can be considered an economic and simple tool to quantify crop water requirements. In the last two decades, agro-hydrological physically based models have been developed to simulate mass and energy exchange processes in the soil-plant-atmosphere system. Although very reliable, due to the high number of required variables, simplified models have been proposed as simple tools to quantify crop water consumes. The main aim of the paper is to assess, for a Sicilian orchard of table olive, the suitability of FAO-56 agro-hydrological model to estimate the crop transpiration under soil water deficit conditions. The model validation is carried out by means of measurements of…
Extending the Tsetlin Machine With Integer-Weighted Clauses for Increased Interpretability
2020
Despite significant effort, building models that are both interpretable and accurate is an unresolved challenge for many pattern recognition problems. In general, rule-based and linear models lack accuracy, while deep learning interpretability is based on rough approximations of the underlying inference. Using a linear combination of conjunctive clauses in propositional logic, Tsetlin Machines (TMs) have shown competitive performance on diverse benchmarks. However, to do so, many clauses are needed, which impacts interpretability. Here, we address the accuracy-interpretability challenge in machine learning by equipping the TM clauses with integer weights. The resulting Integer Weighted TM (…
Emulation as an Accurate Alternative to Interpolation in Sampling Radiative Transfer Codes
2018
Computationally expensive radiative transfer models (RTMs) are widely used to realistically reproduce the light interaction with the earth surface and atmosphere. Because these models take long processing time, the common practice is to first generate a sparse look-up table (LUT) and then make use of interpolation methods to sample the multidimensional LUT input variable space. However, the question arise whether common interpolation methodsperform most accurate. As an alternative to interpolation, this paper proposes to use emulation, i.e., approximating the RTM output by means of the statistical learning. Two experiments were conducted to assess the accuracy in delivering spectral outputs…
Adding Partial Functions to Constraint Logic Programming with Sets
2015
AbstractPartial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}. Although partial functions could be programmed on top of {log}, providing them as first-class citizens adds valuable flexibility and generality to the form of set-theoretic formulas that the language can safely deal with. In particular, the paper shows how the {log} constraint solver is naturally extended in order to accommodate for the new primitive constrain…
Improving table compression with combinatorial optimization
2002
We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on the theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, …
Transient dynamics of pulse-driven memristors in the presence of a stable fixed point
2019
Abstract Some memristors are quite interesting from the point of view of dynamical systems. When driven by narrow pulses of alternating polarities, their dynamics has a stable fixed point, which may be useful for future applications. We study the transient dynamics of two types of memristors characterized by a stable fixed point using a time-averaged evolution equation. Time-averaged trajectories of the Biolek window function memristor and resistor-threshold type memristor circuit (an effective memristor) are determined analytically, and the times of relaxation to the stable fixed point are found. Our analytical results are in perfect agreement with the results of numerical simulations.
Futures pricing in electricity markets based on stable CARMA spot models
2012
We present a new model for the electricity spot price dynamics, which is able to capture seasonality, low-frequency dynamics and the extreme spikes in the market. Instead of the usual purely deterministic trend we introduce a non-stationary independent increments process for the low-frequency dynamics, and model the large uctuations by a non-Gaussian stable CARMA process. The model allows for analytic futures prices, and we apply these to model and estimate the whole market consistently. Besides standard parameter estimation, an estimation procedure is suggested, where we t the non-stationary trend using futures data with long time until delivery, and a robust L 1 -lter to nd the states of …
Quantum, stochastic, and pseudo stochastic languages with few states
2014
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin proved the set of stochastic languages to be uncountable presenting a single 2-state PFA over the binary alphabet recognizing uncountably many languages depending on the cutpoint. In this paper, we show the same result for unary stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2-state unary QFA, and a family of 3-state unary PFAs recognizing uncountably many languages; all th…
WarpCore: A Library for fast Hash Tables on GPUs
2020
Hash tables are ubiquitous. Properties such as an amortized constant time complexity for insertion and querying as well as a compact memory layout make them versatile associative data structures with manifold applications. The rapidly growing amount of data emerging in many fields motivated the need for accelerated hash tables designed for modern parallel architectures. In this work, we exploit the fast memory interface of modern GPUs together with a parallel hashing scheme tailored to improve global memory access patterns, to design WarpCore -- a versatile library of hash table data structures. Unique device-sided operations allow for building high performance data processing pipelines ent…
Bayesian inference for the extremal dependence
2016
A simple approach for modeling multivariate extremes is to consider the vector of component-wise maxima and their max-stable distributions. The extremal dependence can be inferred by estimating the angular measure or, alternatively, the Pickands dependence function. We propose a nonparametric Bayesian model that allows, in the bivariate case, the simultaneous estimation of both functional representations through the use of polynomials in the Bernstein form. The constraints required to provide a valid extremal dependence are addressed in a straightforward manner, by placing a prior on the coefficients of the Bernstein polynomials which gives probability one to the set of valid functions. The…