Influence of spatial variability of permeability property on steady state seepage flow and slope stability analysis

In recent years, spatial variability modeling of soil parameters using random field theory has gained distinct importance in geotechnical analysis. In the present Study, commercially available finite difference numerical code FLAC 5.0 is used for modeling the permeability parameter as spatially correlated log-normally distributed random variable and its influence on the steady state seepage flow and on the slope stability analysis are studied. Considering the case of a 5.0 m high cohesive-frictional soil slope of 30 degrees, a range of coefficients of variation (CoV%) from 60 to 90% in the permeability Values, and taking different values of correlation distance in the range of 0.5-15 m, parametric studies, using Monte Carlo simulations, are performed to study the following three aspects, i.e., (i) effect ostochastic soil permeability on the statistics of seepage flow in comparison to the analytic (Dupuit's) solution available for the uniformly constant permeability property; (ii) strain and deformation pattern, and (iii) stability of the given slope assessed in terms of factor of safety (FS). The results obtained in this study are useful to understand the role of permeability variations in slope stability analysis under different slope conditions and material properties. (C) 2009 Elsevier B.V. All rights reserved.

Multi-Tone Testing of Linear and Nonlinear Analog Circuits using Polynomial Coefficients

A method of testing for parametric faults of analog circuits based on a polynomial representation of fault-free function of the circuit is presented. The response of the circuit under test (CUT) is estimated as a polynomial in the applied input voltage at relevant frequencies in addition to DC. Classification or Cur is based on a comparison of the estimated polynomial coefficients with those of the fault free circuit. This testing method requires no design for test hardware as might be added to the circuit fly some other methods. The proposed method is illustrated for a benchmark elliptic filter. It is shown to uncover several parametric faults causing deviations as small as 5% from the nominal values.

Rheology of dense sheared granular flows

Rapid granular flows are defined as flows in which the time scales for the particle interactions are small compared to the inverse of the strain rate, so that the particle interactions can be treated as instantaneous collisions. We first show, using Discrete Element simulations, that even very dense flows of sand or glass beads with volume fraction between 0.5 and 0.6 are rapid granular flows. Since collisions are instantaneous, a kinetic theory approach for the constitutive relations is most appropriate, and we present kinetic theory results for different microscopic models for particle interaction. The significant difference between granular flows and normal fluids is that energy is not conserved in a granular flow. The differences in the hydrodynamic modes caused by the non-conserved nature of energy are discussed. Going beyond the Boltzmann equation, the effect of correlations is studied using the ring kinetic approximation, and it is shown that the divergences in the viscometric coefficients, which are present for elastic fluids, are not present for granular flows because energy is not conserved. The hydrodynamic model is applied to the flow down an inclined plane. Since energy is not a conserved variable, the hydrodynamic fields in the bulk of a granular flow are obtained from the mass and momentum conservation equations alone. Energy becomes a relevant variable only in thin 'boundary layers' at the boundaries of the flow where there is a balance between the rates of conduction and dissipation. We show that such a hydrodynamic model can predict the salient features of a chute flow, including the flow initiation when the angle of inclination is increased above the 'friction angle', the striking lack of observable variation of the volume fraction with height, the observation of a steady flow only for certain restitution coefficients, and the density variations in the boundary layers.

Structural Studies on the Second Mycobacterium smegmatis Dps: Invariant and Variable Features of Structure, Assembly and Function

A second DNA binding protein from stationary-phase cells of Mycobacterium smegmatis (MsDps2) has been identified from the bacterial genome. It was cloned, expressed and characterised and its crystal structure was determined. The core dodecameric structure of MsDps2 is the same as that of the Dps from the organism described earlier (MsDps1). However, MsDps2 possesses a long N-terminal tail instead of the C-terminal tail in MsDps1. This tail appears to be involved in DNA binding. It is also intimately involved in stabilizing the dodecamer. Partly on account of this factor, MsDps2 assembles straightway into the dodecamer, while MsDps1 does so on incubation after going through an intermediate trimeric stage. The ferroxidation centre is similar in the two proteins, while the pores leading to it exhibit some difference. The mode of sequestration of DNA in the crystalline array of molecules, as evidenced by the crystal structures, appears to be different in MsDps1 and MsDps2, highlighting the variability in the mode of Dps–DNA complexation. A sequence search led to the identification of 300 Dps molecules in bacteria with known genome sequences. Fifty bacteria contain two or more types of Dps molecules each, while 195 contain only one type. Some bacteria, notably some pathogenic ones, do not contain Dps. A sequence signature for Dps could also be derived from the analysis.

Effect of associating anions on phosphorus retention in soil II. Under variable anion concentration

The results of the present investigation reveal that the presence of anions in the reacting medium greatly modify the reactions between soil and solution P. Associating anions reduce considerably the retention of phosphate in soils. Citrate, tartrate, and silicate are found to be superior to arsenate, oxalate, and fluoride in reducing phosphate retention in soil. The performance of associating anions depends on the pH and P concentration of the reacting medium. The nature and properties of soil also play a highly significant role on the effectiveness of associating anions.

Fugacity coefficients. Enthalpy, and second virial coefficients of boron trifluoride

Fugacity coefficients and isothermal changes of enthalpy have been calculated and reported. The calculations cover a temperature range of 0° to 75°C. up to gas densities of 1.0 gram per cc. The generalized Benedict-Webb-Rubin constants evaluated from generalized PVT relations is found to predict the experimental data with an over-all absolute deviation of 3.1%. Second virial coefficients and potential energy parameters for Lennard-Jones (12-6) potential energy function are reported also.

Mass Transfer Coefficients in Mixer-Settlers

Mass transfer coefficients have been determined for transfer into a highly viscous phase in a stirred tank involving high Schmidt numbers. The results have been used to compute mass transfer coefficients in the extraction of free fatty acids from oils using alcohol and show good agreement with experimental results

Asymptotic behaviour and boundedness of linear systems with time varying coefficients

Motivated by developments in spacecraft dynamics, the asymptotic behaviour and boundedness of solution of a special class of time varying systems in which each term appears as the sum of a constant and a time varying part, are analysed in this paper. It is not possible to apply standard textbook results to such systems, which are originally in second order. Some of the existing results are reformulated. Four theorems which explore the relations between the asymptotic behaviour/boundedness of the constant coefficient system, obtained by equating the time varying terms to zero, to the corresponding behaviour of the time varying system, are developed. The results show the behaviour of the two systems to be intimately related, provided the solutions of the constant coefficient system approach zero are bounded for large values of time, and the time varying terms are suitably restrained. Two problems are tackled using these theorems.

Switching frequency variation control in hysteresis PWM controller for IM drives using variable parabolic bands for current error space phasor

Variation of switching frequency over the entire operating speed range of an induction motor (M drive is the major problem associated with conventional two-level three-phase hysteresis controller as well as the space phasor based PWM hysteresis controller. This paper describes a simple hysteresis current controller for controlling the switching frequency variation in the two-level PWM inverter fed IM drives for various operating speeds. A novel concept of continuously variable hysteresis boundary of current error space phasor with the varying speed of the IM drive is proposed in the present work. The variable parabolic boundary for the current error space phasor is suggested for the first time in this paper for getting the switching frequency pattern with the hysteresis controller, similar to that of the constant switching frequency voltage-controlled space vector PWM (VC-SVPWM) based inverter fed IM drive. A generalized algorithm is also developed to determine parabolic boundary for controlling the switching frequency variation, for any IM load. Only the adjacent inverter voltage vectors forming a triangular sector, in which tip of the machine voltage vector ties, are switched to keep current error space vector within the parabolic boundary. The controller uses a self-adaptive sector identification logic, which provides smooth transition between the sectors and is capable of taldng the inverter up to six-step mode of operation, if demanded by drive system. The proposed scheme is simulated and experimentally verified on a 3.7 kW IM drive.

Theoretical foundations for multiple rendezvous of glowworm-inspired mobile agents with variable local-decision domains

We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.