Smallholder pig production systems along a periurban-rural gradient in the Western provinces of the Democratic Republic of the Congo

In the Democratic Republic of the Congo (DRC), pigs are raised almost exclusively by smallholders either in periurban areas of major cities such as Kinshasa or in rural villages. Unfortunately, little information is available regarding pig production in the Western part of the DRC, wherefore a survey was carried out to characterize and compare 319 pig production systems in their management and feeding strategies, along a periurban - rural gradient inWestern provinces of the DRC. Pig breeding was the main source of income (43%) and half of respondents were active in mixed pig and crop production, mainly vegetable garden. Depending on the location, smallholders owned on average 18 pigs, including four sows. Piglet mortality rate varied from 9.5 to 21.8% while average weaned age ranged between 2.2 and 2.8 months. The major causes of mortality reported by the farmers were African swine fever 98 %, swine erysipelas (60 %), erysipelas trypanosomiasis (31 %), swine worm infection (17 %), and diarrhoea (12 %). The majority of the pigs were reared in pens without free roaming and fed essentially with locally available by-products and forage plants whose nature varied according with the location of the farm. The pig production systems depended on the local environment; particularly in terms of workforces, herd structure and characteristics, production parameters, pig building materials, selling price and in feed resources. It can be concluded that an improvement of Congolese pig production systems should consider (1) a reduction of inbreeding, (2) an improvement in biosafety to reduce the incidence of African swine fever and the spread of other diseases, and (3) an improvement in feeding practices.

A generic formula for the values at the boundary points of monic classical orthogonal polynomials

In a previous paper we have determined a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type σ(x)y"n(x)+τ(x)y'n(x)-λnyn(x)=0. In this paper, we give another such formula which enables us to present a generic formula for the values of monic classical orthogonal polynomials at their boundary points of definition.

Characterization theorem for classical orthogonal polynomials on non-uniform lattices: The functional approach

Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the Riccati equation for the formal Stieltjes function.

Moments of classical orthogonal polynomials

The aim of this work is to find simple formulas for the moments mu_n for all families of classical orthogonal polynomials listed in the book by Koekoek, Lesky and Swarttouw. The generating functions or exponential generating functions for those moments are given.

On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials

In this work, we have mainly achieved the following: 1. we provide a review of the main methods used for the computation of the connection and linearization coefficients between orthogonal polynomials of a continuous variable, moreover using a new approach, the duplication problem of these polynomial families is solved; 2. we review the main methods used for the computation of the connection and linearization coefficients of orthogonal polynomials of a discrete variable, we solve the duplication and linearization problem of all orthogonal polynomials of a discrete variable; 3. we propose a method to generate the connection, linearization and duplication coefficients for q-orthogonal polynomials; 4. we propose a unified method to obtain these coefficients in a generic way for orthogonal polynomials on quadratic and q-quadratic lattices. Our algorithmic approach to compute linearization, connection and duplication coefficients is based on the one used by Koepf and Schmersau and on the NaViMa algorithm. Our main technique is to use explicit formulas for structural identities of classical orthogonal polynomial systems. We find our results by an application of computer algebra. The major algorithmic tools for our development are Zeilberger’s algorithm, q-Zeilberger’s algorithm, the Petkovšek-van-Hoeij algorithm, the q-Petkovšek-van-Hoeij algorithm, and Algorithm 2.2, p. 20 of Koepf's book "Hypergeometric Summation" and it q-analogue.

Controlling the transport of an ion: classical and quantum mechanical solutions

The accurate transport of an ion over macroscopic distances represents a challenging control problem due to the different length and time scales that enter and the experimental limitations on the controls that need to be accounted for. Here, we investigate the performance of different control techniques for ion transport in state-of-the-art segmented miniaturized ion traps. We employ numerical optimization of classical trajectories and quantum wavepacket propagation as well as analytical solutions derived from invariant based inverse engineering and geometric optimal control. The applicability of each of the control methods depends on the length and time scales of the transport. Our comprehensive set of tools allows us make a number of observations. We find that accurate shuttling can be performed with operation times below the trap oscillation period. The maximum speed is limited by the maximum acceleration that can be exerted on the ion. When using controls obtained from classical dynamics for wavepacket propagation, wavepacket squeezing is the only quantum effect that comes into play for a large range of trapping parameters. We show that this can be corrected by a compensating force derived from invariant based inverse engineering, without a significant increase in the operation time.