Moving boundaries due to distributed sources in a slab

Analytical and numerical solutions have been obtained for some moving boundary problems associated with Joule heating and distributed absorption of oxygen in tissues. Several questions have been examined which are concerned with the solutions of classical formulation of sharp melting front model and the classical enthalpy formulation in which solid, liquid and mushy regions are present. Thermal properties and heat sources in the solid and liquid regions have been taken as unequal. The short-time analytical solutions presented here provide useful information. An effective numerical scheme has been proposed which is accurate and simple.

Vibration and Stability of Fluid Conveying Pipes with Stochastic Parameters

Flexible cantilever pipes conveying fluids with high velocity are analysed for their dynamic response and stability behaviour. The Young's modulus and mass per unit length of the pipe material have a stochastic distribution. The stochastic fields, that model the fluctuations of Young's modulus and mass density are characterized through their respective means, variances and autocorrelation functions or their equivalent power spectral density functions. The stochastic non self-adjoint partial differential equation is solved for the moments of characteristic values, by treating the point fluctuations to be stochastic perturbations. The second-order statistics of vibration frequencies and mode shapes are obtained. The critical flow velocity is-first evaluated using the averaged eigenvalue equation. Through the eigenvalue equation, the statistics of vibration frequencies are transformed to yield critical flow velocity statistics. Expressions for the bounds of eigenvalues are obtained, which in turn yield the corresponding bounds for critical flow velocities.

Representation of thermodynamic properties of quaternary systems using interaction parameters

Integral excess free energy of a quaternary system has been expressed in terms of the MacLaurin infinite series. The series is subjected to appropriate boundary conditions and each of the derivatives correlated to the corresponding interaction coefficients. The derivation of the partial functions involves extensive summation of various infinite series pertaining to the first order and quaternary parameters to remove any truncational error. The thermodynamic consistency of the derived partials has been established based on the Gibbs-Duhem relations. The equations are used to interpret the thermodynamic properties of the Fe-Cr-Ni-N system.

Studies on structural and electrical properties of barium strontium titanate thin films developed by metallo-organic decomposition

Thin films of barium strontium titanate (BST) including BaTiO3 and SrTiO3 end members were deposited using the metallo-organic decomposition (MOD) technique. Processing parameters such as nonstoichiometry, annealing temperature and time, film thickness and doping concentration were correlated with the structural and electrical properties of the films. A random polycrystalline structure was observed for all MOD films under the processing conditions in this study. The microstructures of the films showed multi-grains structure through the film thickness. A dielectric constant of 563 was observed for (Ba0.7Sr0.3)TiO3 films rapid thermal annealed at 750 degrees C for 60 s. The dielectric constant increased with annealing temperature and film thickness, while the dielectric constant could reach the bulk values for thicknesses as thin as similar to 0.3 mu m. Nonstoichiometry and doping in the films resulted in a lowering of the dielectric constant. For near-stoichiometric films, a small dielectric dispersion obeying the Curie-von Schweidler type dielectric response was observed. This behavior may be attributed to the presence of the high density of disordered grain boundaries. All MOD processed films showed trap-distributed space-charge limited conduction (SCLC) behavior with slope of similar to 7.5-10 regardless of the chemistry and processing parameter due to the presence of main boundaries through the film thickness. The grain boundaries masked the effect of donor-doping, so that all films showed distributed-trap SCLC behavior without discrete-traps. Donor-doping could significantly improve the time-dependent dielectric breakdown behavior of BST thin films, mostly likely due to the lower oxygen vacancy concentration resulted from donor-doping. From the results of charge storage density, leakage current and time-dependent dielectric breakdown behavior, BST thin films are found to be promising candidates for 64 and 256Mb ULSI DRAM applications. (C) 1997 Elsevier Science S.A.

The effect of temperature on the surface tension and adsorption functions of the Fe-S-O melts - an analysis based on interaction parameters

The present investigation analyses the thermodynamic behaviour of the surfaces and adsorption as a function of temperature and composition in the Fe-S-O melts based on the Butler's equations. The calculated-values of the surface tensions exhibit an elevation or depression depending on the type of the added solute at a concentration which coincides with that already present in the system. Generally, the desorption of the solutes as a function of temperature results in an initial increase followed by a decrease in the values of the surface tension. The observations are analyzed based on the surface interaction parameters which are derived in the present research.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

Effect of porosity on the indentation behaviour of nanoporous alumina films

Anodising aluminium in an acid electrolyte results in a porous alumina film. The pores are uniformly distributed and their structure can be controlled by varying the anodising parameters. In this study, the pore structure of the anodic alumina films is varied systematically by varying the anodising time and a subsequent pore widening chemical etch. The indentation behaviour of the resulting film is studied using a depth sensing nanoindenter. The hardness of the films was found to be decreasing with decreasing solid area fraction. Understanding the deformation behaviour of nanoporous alumina would help tailoring the mechanical properties by tuning the geometry.

Stress-strain Curves and Corresponding Structural Parameters in Mulberry and Non-mulberry Silk Fibers

Mulberry fiber (Bivoltine) and non-mulberry fiber (Tassar) were subjected to stress-strain studies and the corresponding samples were examined using wide angle X-ray scattering studies. Here we have two different characteristic stress-strain curves and this has been correlated with changes in crystallite shape ellipsoids in all the fibers. Exclusive crystal structure studies of Tassar fibers show interesting feature of transformation from antiparallel chains to parallel chains.

On the achievable rates of sources having a group alphabet in a distributed source coding setting

We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood decodable (SSD) distributed space-time block codes (DSTBCs) for two-hop wireless relay networks using the amplify and forward protocol. However, to implement DSTBCs from square TE-CODs, the overhead due to the transmission of training symbols becomes prohibitively large as the number of relays increase. In this paper, we propose TE-Coordinate Interleaved Orthogonal Designs (TE-CIODs) to construct SSD DSTBCs. Exploiting the block diagonal structure of TE-CIODs, we show that the overhead due to the transmission of training symbols to implement DSTBCs from TE-CIODs is smaller than that for TE-CODs. We also show that DSTBCs from TE-CIODs offer higher rate than those from TE-CODs for identical number of relays while maintaining the SSD and full-diversity properties.

A token-based distributed algorithm for total order atomic broadcast

In this paper, we propose a new token-based distributed algorithm for total order atomic broadcast. We have shown that the proposed algorithm requires lesser number of messages compared to the algorithm where broadcast servers use unicasting to send messages to other broadcast servers. The traditional method of broadcasting requires 3(N - 1) messages to broadcast an application message, where N is the number of broadcast servers present in the system. In this algorithm, the maximum number of token messages required to broadcast an application message is 2N. For a heavily loaded system, the average number of token messages required to broadcast an application message reduces to 2, which is a substantial improvement over the traditional broadcasting approach.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.