P-glycoprotein (P-gp) expression determines the absorption, distribution, metabolism and excretion of many drugs in the body. Also, up-regulation of P-gp acts as a defense mechanism against acute inflammation. This study examined expression levels of abcb1 mRNA and localization of P-gp protein in the liver, kidney, duodenum, jejunum and ileum in healthy and E. coli infected broilers by real tim...

We present an extension of GP (Genetic Programming) by means of resampling techniques, i.e., Bagging and Boosting. These methods both manipulate the training data in order to improve the learning algorithm. In theory they can signi cantly reduce the error of any weak learning algorithm by repeatedly running it. This paper extends GP by dividing a whole population into a set of subpopulations, e...

We describe three computer searches (in PARI/GP, Maple, and Mathematica, respectively) which led to the discovery of a number of identities of Rogers-Ramanujan type and identities of false theta functions.

Based on a survey data from 361 public employees and suppliers in Taiwan, this study employed the updated DeLone and McLean Information Systems (IS) Success Model to measure e-government procurement (e-GP) system success and assess the moderating effect of computer self-efficacy on users’ judgment of IS success. Results showed that information quality, system quality, and service quality had a ...

BACKGROUND The UK government is pursuing policies to improve primary care access, as many patients visit accident and emergency (A and E) departments after being unable to get suitable general practice appointments. Direct admission to hospital via a general practitioner (GP) averts A and E use, and may reduce total hospital costs. It could also enhance the continuity of information between GPs...

We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...