Novel Algorithm for estimation of Swell Pressure of Fine Grained Soils Based on Diffuse Double Layer (DDL) Theory

Use of engineered landfills for the disposal of industrial wastes is currently a common practice. Bentonite is attracting a greater attention not only as capping and lining materials in landfills but also as buffer and backfill materials for repositories of high-level nuclear waste around the world. In the design of buffer and backfill materials, it is important to know the swelling pressures of compacted bentonite with different electrolyte solutions. The theoretical studies on swell pressure behaviour are all based on Diffuse Double Layer (DDL) theory. To establish a relation between the swell pressure and void ratio of the soil, it is necessary to calculate the mid-plane potential in the diffuse part of the interacting ionic double layers. The difficulty in these calculations is the elliptic integral involved in the relation between half space distance and mid plane potential. Several investigators circumvented this problem using indirect methods or by using cumbersome numerical techniques. In this work, a novel approach is proposed for theoretical estimations of swell pressures of fine-grained soil from the DDL theory. The proposed approach circumvents the complex computations in establishing the relationship between mid-plane potential and diffused plates’ distances in other words, between swell pressure and void ratio.

Reduced common-mode voltage operation of a new seven-level hybrid multilevel inverter topology with a single DC voltage source

In this study, analysis of extending the linear modulation range of a zero common-mode voltage (CMV) operated n-level inverter by allowing reduced CMV switching is presented. A new hybrid seven-level inverter topology with a single DC supply is also presented in this study and inverter operation for zero and reduced CMV is analysed. Each phase of the inverter is realised by cascading two three-level flying capacitor inverters with a half-bridge module in between. Proposed inverter topology is operated with zero CMV for modulation index <86% and is operated with a CMV magnitude of V-dc/18 to extend the modulation range up to 96%. Experimental results are presented for zero CMV operation and for reduced common voltage operation to extend the linear modulation range. A capacitor voltage balancing algorithm is designed utilising the pole voltage redundancies of the inverter, which works for every sampling instant to correct the capacitor voltage irrespective of load power factor and modulation index. The capacitor voltage balancing algorithm is tested for different modulation indices and for various transient conditions, to validate the proposed topology.

STREAM Journal, Vol. 6, No. 1, pp 1-21. Jan-March 2007

CONTENTS: Approaches to understanding pond-dike systems in Asia: the POND-LIVE project approach, by Dave Little, Marc Verdegem and Roel Bosma. The contribution of fish ponds to nutrient cycling in integrated farming systems, by P.N. Muendo, J.J. Stoorvogel and Marc Verdegem. Improving the contribution of fishfarming to livelihoods in Northeast Thailand, by Chittra Arjinkit, Roel Bosma, Danai Turongrouang. Benefits of pond-dike systems in Bangladesh, by M.S. Kabir, M.A. Wahab and Marc Verdegem. Common carp increases rohu production in farmers ponds, by Mohammad Mustafizur Rahman, Md. Abdul Wahab and Marc C.J. Verdegem. Improving pond-dike farming systems in the Mekong delta, Vietnam; the Can Tho approach, by Dang Kieu Nhan, Le Thanh Duong, Le Thanh Phong, Roel H. Bosma and Marc C.J. Verdegem. Fuzzy pathways for farm development in Vietnam, by Roel H. Bosma, Le Thanh Phong, and Dang Kieu Nhan.

Spawn production of common carp

(4 p.)

Recognizing and managing common fish diseases

(4pp.)

STREAM country strategy paper: Cambodia

Cambodia is one of the poorest countries in the world; much of its population live in rural areas and many live below the local poverty line. The management of common property aquatic resources is of over-riding importance to food security and sustainable rural development in Cambodia. The key groups of poor people who use aquatic resources as part of their diverse livelihoods portfolios are subsistence fishers, small-scale aquaculture practitioners and aquatic resources collectors. Subsistence fishers access mainly the rivers, lakes and inundated forests in Tonle Sap provinces, the lower Mekong and Bassac regions and the upper part of the Mekong. Small-scale aquaculture and/or the collection of aquatic resources are most important in provinces that are not rich in fisheries resources including Kompong Speu, Ratnakiri, Mondulkiri, Preah Vihear and Ortdar Meanchey. Freshwater capture fisheries probably contribute more to national food security and the national economy in Cambodia than in any other country in the world. (19 p.)

Supporting the planning of a community fisheries monitoring and evaluation database: a collaborative project undertaken by CFDO, FLD, STREAM, VSO and AYAD

Cambodia is one of the poorest countries in the world; much of its population live in rural areas and many live below the local poverty line. The management of common property aquatic resources is of over-riding importance to food security and sustainable rural development in Cambodia. Aquatic resources are utilized principally by subsistence fishers and the landless, for whom aquatic resource use is an important livelihood activity. Subsistence fishers access mainly the rivers, lakes and inundated forests in Tonle Sap provinces, the lower Mekong and Bassac regions and the upper part of the Mekong. Freshwater capture fisheries probably contribute more to national food security and the national economy in Cambodia than in any other country in the world. (PDF contains 52 pages)

Correcting the systematic error of the density functional theory calculation: the alternate combination approach of genetic algorithm and neural network

The alternate combinational approach of genetic algorithm and neural network (AGANN) has been presented to correct the systematic error of the density functional theory (DFT) calculation. It treats the DFT as a black box and models the error through external statistical information. As a demonstration, the AGANN method has been applied in the correction of the lattice energies from the DFT calculation for 72 metal halides and hydrides. Through the AGANN correction, the mean absolute value of the relative errors of the calculated lattice energies to the experimental values decreases from 4.93% to 1.20% in the testing set. For comparison, the neural network approach reduces the mean value to 2.56%. And for the common combinational approach of genetic algorithm and neural network, the value drops to 2.15%. The multiple linear regression method almost has no correction effect here.

XP. A Common Lisp Pretty Printing System

XP provides efficient and flexible support for pretty printing in Common Lisp. Its single greatest advantage is that it allows the full benefits of pretty printing to be obtained when printing data structures, as well as when printing program code. XP is efficient, because it is based on a linear time algorithm that uses only a small fixed amount of storage. XP is flexible, because users can control the exact form of the output via a set of special format directives. XP can operate on arbitrary data structures, because facilities are provided for specifying pretty printing methods for any type of object. XP also modifies the way abbreviation based on length, nesting depth, and circularity is supported so that they automatically apply to user-defined functions that perform output ??g., print functions for structures. In addition, a new abbreviation mechanism is introduced that can be used to limit the total numbers of lines printed.

XP. A Common Lisp Pretty Printing System

XP provides efficient and flexible support for pretty printing in Common Lisp. Its single greatest advantage is that it allows the full benefits of pretty printing to be obtained when printing data structures, as well as when printing program code. XP is efficient, because it is based on a linear time algorithm that uses a small fixed amount of storage. XP is flexible, because users can control the exact form of the output via a set of special format directives. XP can operate on arbitrary data structures, because facilities are provided for specifying pretty printing methods for any type of object.

Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification

In this paper we present some extensions to the k-means algorithm for vector quantization that permit its efficient use in image segmentation and pattern classification tasks. It is shown that by introducing state variables that correspond to certain statistics of the dynamic behavior of the algorithm, it is possible to find the representative centers fo the lower dimensional maniforlds that define the boundaries between classes, for clouds of multi-dimensional, mult-class data; this permits one, for example, to find class boundaries directly from sparse data (e.g., in image segmentation tasks) or to efficiently place centers for pattern classification (e.g., with local Gaussian classifiers). The same state variables can be used to define algorithms for determining adaptively the optimal number of centers for clouds of data with space-varying density. Some examples of the applicatin of these extensions are also given.

Correction to the pathogenic alternative splicing, caused by the common GNB3 c.825C>T allele, using a novel, antisense morpholino

The very common GNB3 c.825C>T polymorphism (rs5443), is present in approximately half of all human chromosomes. Significantly the presence of the GNB3 825T allele has been strongly associated, with predisposition to essential hypertension. Paradoxically the presence of the GNB3 825T allele, in exon 10, introduces a pathogenic alternative RNA splice site into the middle of exon 9. To attempt to correct this pathogenic aberrant splicing, we therefore bioinformatically designed, using a Gene Tools® algorithm, a GNB3 specific, antisense morpholino. It was hoped that this morpholino would behave in vitro as either a potential “ splice blocker and/or exon skipper, to both bind and inhibit/reduce the aberrant splicing of the GNB3, 825T allele. On transfecting a human lymphoblast cell line homozygous for the 825T allele, with this antisense morpholino, we encouragingly observed both a significant reduction (from ~58% to ~5%) in the production of the aberrant smaller GNB3 transcript, and a subsequent increase in the normal GNB3 transcript (from ~42% to ~95%). Our results demonstrate the potential use of a GNB3 specific antisense morpholino, as a pharmacogenetic therapy for essential hypertension.

Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic.

Efficient Support for Common Relations in Lightweight Formal Reasoning Systems

In work that involves mathematical rigor, there are numerous benefits to adopting a representation of models and arguments that can be supplied to a formal reasoning or verification system: reusability, automatic evaluation of examples, and verification of consistency and correctness. However, accessibility has not been a priority in the design of formal verification tools that can provide these benefits. In earlier work [Lap09a], we attempt to address this broad problem by proposing several specific design criteria organized around the notion of a natural context: the sphere of awareness a working human user maintains of the relevant constructs, arguments, experiences, and background materials necessary to accomplish the task at hand. This work expands one aspect of the earlier work by considering more extensively an essential capability for any formal reasoning system whose design is oriented around simulating the natural context: native support for a collection of mathematical relations that deal with common constructs in arithmetic and set theory. We provide a formal definition for a context of relations that can be used to both validate and assist formal reasoning activities. We provide a proof that any algorithm that implements this formal structure faithfully will necessary converge. Finally, we consider the efficiency of an implementation of this formal structure that leverages modular implementations of well-known data structures: balanced search trees and transitive closures of hypergraphs.

GreedyDual* Web Caching Algorithm: Exploiting the Two Sources of Temporal Locality in Web Request Streams

The relative importance of long-term popularity and short-term temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of temporal locality that enables the identification of the relative strengths of these two sources of temporal locality in a reference stream. In [21], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of temporal locality. These finding underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence of these two sources of temporal locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual*, which is a generalization of GreedyDual-Size. GreedyDual* uses the metrics proposed in [21] to adjust the relative worth of long-term popularity versus short-term temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual* when compared to other Web cache replacement policies proposed in the literature.