Search results for "Proximate"

Assessment of the Energy Potential of Chicken Manure in Poland

2019

Animal waste, including chicken manure, is a category of biomass considered for application in the energy industry. Poland is leading poultry producer in Europe, with a chicken population assessed at over 176 million animals. This paper aims to determine the theoretical and technical energy potential of chicken manure in Poland. The volume of chicken manure was assessed as 4.49 million tons per year considering three particular poultry rearing systems. The physicochemical properties of examined manure specimens indicate considerable conformity with the data reported in the literature. The results of proximate and ultimate analyses confirm a considerable effect of the rearing system on the e…

Integrating resolution—like procedures with Lukasiewicz implication

1993

We discuss some conceptual and technical problems raised by the attempt of integrating resolution-like procedures with the use of Lukukasiewicz implication Min{1, 1 – [a] + [b]} in an environment of approximate reasoning modelled by fuzzy logics.

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching

2010

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the text s requires to find a substring t of s with p(t) = q. The corresponding decision problem is to verify whether at least one such match exists. So, for example for the alphabet Σ = {a, b, c}, the string s = abaccbabaaa has Parikh vector p(s) = (6,3,2), and the Parikh vector q = (2,1,1) appears once in s in position (1,4). Like its more precise counterpart, the renown Exact String Matching, Jumbled Pattern Matching has ubiquitous applications, e.g., string matching with a dyslectic word processor, table rearrangements, …

Best proximity point theorems for rational proximal contractions

2013

Abstract We provide sufficient conditions which warrant the existence and uniqueness of the best proximity point for two new types of contractions in the setting of metric spaces. The presented results extend, generalize and improve some known results from best proximity point theory and fixed-point theory. We also give some examples to illustrate and validate our definitions and results. MSC:41A65, 46B20, 47H10.

Increased susceptibility to oxidative stress as a proximate cost of reproduction

2004

Proximate and Sensory Evaluation of Fermented Seasonings from Soybean and Fluted Pumpkin Seeds

2020

Specialty condiment (ogiri) was produced from seeds of soybean (Glycine max) and fluted pumpkin (Telfairia occidentalis) by spontaneous moist solid substrate fermentation of their pre-processed mash. The two samples coded FSBM and FFPM respectively were evaluated for nutritional quality. Effects of fermentation on proximate values of the seeds were also analyzed. The two samples were further subjected to sensory analysis using commercial brand made  from castor bean (Ricinus communis) seeds coded FCBM as a control. Results show that FFPM was significantly (p < 0.05) higher in ash, crude fiber and protein, but significantly lower in moisture and fat than the FSBM. There was no significant…

On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction

2020

Approximate Bayesian computation allows for inference of complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We consider an approach using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure its sufficient mixing, and post-processing the output leading to estimators for a range of finer tolerances. We introduce an approximate confidence interval for the related post-corrected estimators, and propose an adaptive approximate Bayesi…

Compressed Particle Methods for Expensive Models With Application in Astronomy and Remote Sensing

2021

In many inference problems, the evaluation of complex and costly models is often required. In this context, Bayesian methods have become very popular in several fields over the last years, in order to obtain parameter inversion, model selection or uncertainty quantification. Bayesian inference requires the approximation of complicated integrals involving (often costly) posterior distributions. Generally, this approximation is obtained by means of Monte Carlo (MC) methods. In order to reduce the computational cost of the corresponding technique, surrogate models (also called emulators) are often employed. Another alternative approach is the so-called Approximate Bayesian Computation (ABC) sc…

Exponential sums related to Maass forms

2019

We estimate short exponential sums weighted by the Fourier coefficients of a Maass form. This requires working out a certain transformation formula for non-linear exponential sums, which is of independent interest. We also discuss how the results depend on the growth of the Fourier coefficients in question. As a byproduct of these considerations, we can slightly extend the range of validity of a short exponential sum estimate for holomorphic cusp forms. The short estimates allow us to reduce smoothing errors. In particular, we prove an analogue of an approximate functional equation previously proven for holomorphic cusp form coefficients. As an application of these, we remove the logarithm …

Languages with mismatches and an application to approximate indexing

2005

In this paper we describe a factorial language, denoted by L(S, k,r), that contains all words that occur in a string 5 up to k mismatches every r symbols. Then we give some combinatorial properties of a parameter, called repetition index and denoted by R(S,k,r), defined as the smallest integer h ? 1 such that all strings of this length occur at most in a unique position of the text S up to k mismatches every r symbols. We prove that R(S, k, r) is a non-increasing function of r and a non-decreasing function of k and that the equation r = R(S, k, r) admits a unique solution. The repetition index plays an important role in the construction of an indexing data structure based on a trie that rep…