Assessing the suitability of rice cultivation in Muvumba P-8 marshland of Rwanda using soil properties

This paper deals with the estimation of different soil properties of Muvumba P-8 marshland in Rwanda to assess the soil for its suitability for rice cultivation. The objective of the research is to determine the soil properties. Properties like texture, bulk density, total available water, infiltration rate, hydraulic conductivity and permeability were determined. Soil properties were estimated for different soil depths of 0-15, 15-30, 30-45 and 45-60 cm. It was found that the layer of the soil with 0-15, 15-30 and 30-45 cm is having the soil texture of sandy clay loam and the depth of 45-60 cm is having the texture of clay loam. The soil of the plots with depths like 0-15, 15-30, 30-45 and 45-60 cm are having the clay content of 21, 25, 26 and 38% respectively and are having the bulk densities of 1.38, 1.29, 1.33 and 1.12 gm/cm3. It shows that clay content increases as the depth of the soil increases. The average total available water for three different depths mentioned are 8.5, 11.2, 15.5 and 16.5 mm and it varies from 4.5 mm to 26.4 mm. The data were analysed by using GENISTAT in order to get the difference of variation. The average infiltration rate of the field at Muvumba P-8 marshland was 12.8 mm/hour. It means that a water layer of 12.8 mm on the soil surface will take one hour to infiltrate. The experimental plot at Muvumba P-8 marshland was found to be moderately slow infiltration rate but it has rapid permeability. It indicates that there is slow entry of water in top soil surface but the percolation will be faster due rapid permeability. It is good for rice cultivation. Keywords: Soil properties-weather parameters-marshland-assessment-rice cultivatio

Improving Strategies via SMT Solving

We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widening operators for enforcing convergence within a finite number of iterations (ii) the use of merge operations (often, convex hulls) at the merge points of the control flow graph. It instead computes the least inductive invariant expressible in the domain at a restricted set of program points, and analyzes the rest of the code en bloc. We emphasize that we compute this inductive invariant precisely. For that we extend the strategy improvement algorithm of [Gawlitza and Seidl, 2007]. If we applied their method directly, we would have to solve an exponentially sized system of abstract semantic equations, resulting in memory exhaustion. Instead, we keep the system implicit and discover strategy improvements using SAT modulo real linear arithmetic (SMT). For evaluating strategies we use linear programming. Our algorithm has low polynomial space complexity and performs for contrived examples in the worst case exponentially many strategy improvement steps; this is unsurprising, since we show that the associated abstract reachability problem is Pi-p-2-complete

Speeding up the constraint-based method in difference logic

"The final publication is available at http://link.springer.com/chapter/10.1007%2F978-3-319-40970-2_18"Over the years the constraint-based method has been successfully applied to a wide range of problems in program analysis, from invariant generation to termination and non-termination proving. Quite often the semantics of the program under study as well as the properties to be generated belong to difference logic, i.e., the fragment of linear arithmetic where atoms are inequalities of the form u v = k. However, so far constraint-based techniques have not exploited this fact: in general, Farkas’ Lemma is used to produce the constraints over template unknowns, which leads to non-linear SMT problems. Based on classical results of graph theory, in this paper we propose new encodings for generating these constraints when program semantics and templates belong to difference logic. Thanks to this approach, instead of a heavyweight non-linear arithmetic solver, a much cheaper SMT solver for difference logic or linear integer arithmetic can be employed for solving the resulting constraints. We present encouraging experimental results that show the high impact of the proposed techniques on the performance of the VeryMax verification systemPeer ReviewedPostprint (author's final draft

Factorized variational approximations for acoustic multi source localization

Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation of the Chi distribution that is applicable to general RSS source localization problems in sensor networks. Using our Gaussian approximation, we provide a factorized variational Bayes (VB) approximation to the location and power posterior of multiple sources using a sensor network. When the source signal and the sensor noise have uncorrelated Gaussian distributions, we demonstrate that the envelope of the sensor output can be accurately modeled with a multiplicative Gaussian noise model. In turn, our factorized VB approximations decrease the computational complexity and provide computational robustness as the number of targets increases. Simulations are provided to demonstrate the effectiveness of the proposed approximations

Ranking Templates for Linear Loops

We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we use Motzkin's Transposition Theorem instead of Farkas Lemma to transform the generated $\exists\forall$-constraint into an $\exists$-constraint.Comment: TACAS 201

Ensemble of Hankel Matrices for Face Emotion Recognition

In this paper, a face emotion is considered as the result of the composition of multiple concurrent signals, each corresponding to the movements of a specific facial muscle. These concurrent signals are represented by means of a set of multi-scale appearance features that might be correlated with one or more concurrent signals. The extraction of these appearance features from a sequence of face images yields to a set of time series. This paper proposes to use the dynamics regulating each appearance feature time series to recognize among different face emotions. To this purpose, an ensemble of Hankel matrices corresponding to the extracted time series is used for emotion classification within a framework that combines nearest neighbor and a majority vote schema. Experimental results on a public available dataset shows that the adopted representation is promising and yields state-of-the-art accuracy in emotion classification.Comment: Paper to appear in Proc. of ICIAP 2015. arXiv admin note: text overlap with arXiv:1506.0500

Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation

We apply multivariate Lagrange interpolation to synthesize polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitative loop invariant to solving constraints over program variables and unknown coefficients. Lagrange interpolation allows us to find constraints with less unknown coefficients. Counterexample-guided refinement furthermore generates linear constraints that pinpoint the desired quantitative invariants. We evaluate our technique by several case studies with polynomial quantitative loop invariants in the experiments

Joint acoustic-video fingerprinting of vehicles, part II

In this second paper, we first show how to estimate the wheelbase length of a vehicle using line metrology in video. We then address the vehicle fingerprinting problem using vehicle silhouettes and color invariants. We combine the acoustic metrology and classification results discussed in Part I with the video results to improve estimation performance and robustness. The acoustic video fusion is achieved in a Bayesian framework by assuming conditional independence of the observations of each modality. For the metrology density functions, Laplacian approximations are used for computational efficiency. Experimental results are given using field data

Interactions of a j=1j=1 boson in the 2(2j+1)2(2j+1) component theory

The amplitudes for boson-boson and fermion-boson interactions are calculated in the second order of perturbation theory in the Lobachevsky space. An essential ingredient of the used model is the Weinberg's $2(2j+1)$ component formalism for describing a particle of spin $j$, recently developed substantially. The boson-boson amplitude is then compared with the two-fermion amplitude obtained long ago by Skachkov on the ground of the hamiltonian formulation of quantum field theory on the mass hyperboloid, $p_0^2 -{\bf p}^2=M^2$, proposed by Kadyshevsky. The parametrization of the amplitudes by means of the momentum transfer in the Lobachevsky space leads to same spin structures in the expressions of $T$ matrices for the fermion and the boson cases. However, certain differences are found. Possible physical applications are discussed.Comment: REVTeX 3.0 file. 12pp. Substantially revised version of IFUNAM preprints FT-93-24, FT-93-3

Swimming using surface acoustic waves

Microactuation of free standing objects in fluids is currently dominated by the rotary propeller, giving rise to a range of potential applications in the military, aeronautic and biomedical fields. Previously, surface acoustic waves (SAWs) have been shown to be of increasing interest in the field of microfluidics, where the refraction of a SAW into a drop of fluid creates a convective flow, a phenomenon generally known as SAW streaming. We now show how SAWs, generated at microelectronic devices, can be used as an efficient method of propulsion actuated by localised fluid streaming. The direction of the force arising from such streaming is optimal when the devices are maintained at the Rayleigh angle. The technique provides propulsion without any moving parts, and, due to the inherent design of the SAW transducer, enables simple control of the direction of travel