Effect of hygiene measures, water sanitation and oral rehydration therapy on diarrhea in children less than five years old in the south of Ivory Coast

BACKGROUND: Gastric sucrose permeability is a noninvasive marker that reliably increases in association with gastrointestinal injury due to use of nonsteroidal antiinflammatory drugs. Despite the effect of Helicobacter pylori infection on the gastric mucosa, in a previous study we were unable to demonstrate that H. pylori infection was associated with abnormal gastric sucrose permeability. Our goal in this study was to explore further whether H. pylori infection changed gastric permeability; therefore, we evaluated the effect of treatment of H. pylori infection on gastric permeability to sucrose and the relation of sucrose permeability to density of polymorphonuclear leukocytes. MATERIALS AND METHODS: Five hundred milliliters of a solution containing 100 gm of sucrose was ingested by the subject at bedtime. Overnight urine was collected and assayed for sucrose by high-performance liquid chromatography. Sucrose permeability was assessed both before and approximately 4 weeks after anti-H. pylori therapy. RESULTS: Seventeen asymptomatic H. pylori-infected volunteers participated; 8 were cured. Sucrose permeability was in the range commonly found in normal controls both before and after anti-H. pylori therapy (mean excretion, 76.3 mg; range, 13-171 mg). Gastric sucrose permeability correlated with the density of polymorphonulcear cell infiltration of the mucosa. Cure of the H. pylori infection was associated with a small but significant decrease in sucrose permeability (98.8 +/- 18 mg to 51.7 +/- 9.8 mg (p = .01). Sucrose permeability was greater in those with a high density of mucosal polymorphonuclear cells compared to those with lower scores (119.5 +/- 4 vs 71.4 +/- 13 for those with scores > or = 5 compared to scores < or = 4; p = .023). Failed therapy resulted in an increase in the mucosal density of polymorphonuclear infiltration and sucrose permeability (56.4 +/- 13 mg-99.7 +/- 19 mg pretreatment vs posttreatment, respectively; p = .031). CONCLUSION: H. pylori gastritis causes a small but measurable increase in gastric permeability to sucrose that may reflect epithelial transmigration of neutrophils.     

Certain nonlinear partially observable stochastic optimal controlproblems with explicit control laws equivalent to LEQG/LQG problems

This paper is concerned with partially observed stochastic optimal control problems when nonlinearities enter the dynamics of the unobservable state and the observations as gradients of potential functions. Explicit representations for the information state are derived in terms of a finite number of sufficient statistics. Consequently, the partially observed problem is recast as one of complete information with a new state generated by a modified version of the Kalman filter. When the terminal cost is quadratic in the unobservable state and includes the integral of the nonlinearities, the optimal control laws are explicitly computed, similar to linear-exponential-quadratic-Gaussian (LEQG) and linear-quadratic-Gaussian (LQG) tracking problems. The results are applicable to filtering and control of Hamiltonian systems     

Positive temperature dependence of the electron impact ionizationcoefficient in In0.53Ga0.47As/InP HBTs

Impact ionization is a major limiting factor to the maximum operating voltage of InGaAs-based, high-speed transistors. In this work, data on the positive temperature dependence of the electron impact ionization coefficient α_n in In_0.53Ga_0.47As at medium-low electric fields are reported for the first time. The increase of α_n with temperature is opposite to the behavior normally observed in most semiconductors. This anomalous behavior implies the onset of a positive feedback between power dissipation and avalanche generation which may adversely affect the power handling capability of In_0.53Ga _0.47As-based devices, and which should be taken into account in device thermal modeling. In the experimental procedure, based on the measurement of the multiplication factor M-1 in npn In_0.53Ga _0.47As/InP Heterojunction Bipolar Transistors (HBT), particular care has been taken in order to rule out possible spurious, temperature-dependent contributions to the measured multiplication current     

Application of neural networks and machine learning in networkdesign

Communication network design is becoming increasingly complex, involving making networks more usable, affordable, and reliable. To help with this, we have proposed an expert network designer (END) for configuring, modeling, simulating, and evaluating large structured computer networks, employing artificial intelligence, knowledge representation, and network simulation tools. We present a neural network/knowledge acquisition machine-learning approach to improve the END's efficiency in solving the network design problem and to extend its scope to acquire new networking technologies, learn new network design techniques, and update the specifications of existing technologies     

Cultural adaptation and information design: two contrasting views

Approaches to using visual language in a cultural context can be placed on a continuum, with global (universal) on one end and culture-focused on the other. Each approach reveals contrasting assumptions about three central design issues: perception, aesthetics and pragmatics. The global approach is characterized by attempts to invent an objective, universal visual language or to define such a language through perceptual principles and empirical research. The culture-focused perspective is founded on the principle that visual communication is intimately bound to experience and hence can function only within a given cultural context, to which designers must be sensitive. While the modernist, universal approach has been losing ground to the postmodern, culture-focused approach, the two complement each other in a variety of ways and, depending on the rhetorical situation, offer pragmatic benefits and drawbacks     

Scientific and artistic investigation of multi-dimensional fractals on the AT & T pixel machine

The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well.     

Function materialization in object bases: design, realization, andevaluation

View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM     

Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

Partial indexing for nonuniform data distributions in relationalDBMS's

It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B⁺trees. The effectiveness of the B ⁺tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B⁺tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes