The mechanical response of tetragonal zirconia polycrystal to conical indentation

Blocks of 3Y-TZP were indented with conical diamond indenters. indentation caused tetragonal to monoclinic phase transformation in a subsurface. Of the cracks generated in the subsurface, radial and lateral cracks can be accounted for by a continuum model of the indented subsurface, built using a combination of the Boussinesq and blister stress fields. Additional ring, median and cone cracks were also observed. It is hypothesized that the latter are motivated by the reduction in blister strength or residual energy brought about by the material damage caused by the phase transformation. This damage reduces the load bearing capacity of the material progressively with increasing normal load.

Electron transfer reaction in the marcus inverted region: role of high frequency vibrational modes

A theoretical study of the dynamics of photo-electron transfer reactions in the Marcus inverted regime is presented. This study is motivated partly by the recent proposal of Barbara et al. (J. Phys. Chem. 96, 3728, 1991) that a minimal model of an electron transfer reaction should consist of a polar solvent mode (X), a low frequency vibrational mode (Q) and one high frequency mode (q). Interplay between these modes may be responsible for the crossover observed in the dynamics from a solvent controlled to a vibrational controlled electron transfer. The following results have been obtained. (i) In the case of slowly relaxing solvents, the proximity of the point of excitation to an effective sink on the excited surface is critical in determining the decay of the reactant population. This is because the Franck-Condon overlap between the reactant ground and the product excited states decreases rapidly with increase in the quantum number of the product vibrational state. (ii) Non-exponential solvation dynamics has an important effect in determining the rates of electron transfer. Especially, a biphasic solvation and a large coupling between the reactant and the product states both may be needed to explain the experimental results. ©1996 American Institute of Physics

Saturation throughput analysis of an input queueing ATM switch with multiclass bursty traffic

In this paper we consider an N x N non-blocking, space division ATM switch with input cell queueing. At each input, the cell arrival process comprises geometrically distributed bursts of consecutive cells for the various outputs. Motivated by the fact that some input links may be connected to metropolitan area networks, and others directly to B-ISDN terminals, we study the situation where there are two classes of inputs with different values of mean burst length. We show that when inputs contend for an output, giving priority to an input with smaller expected burst length yields a saturation throughput larger than if the reverse priority is given. Further, giving priority to less bursty traffic can give better throughput than if all the inputs were occupied by this less bursty traffic. We derive the asymptotic (as N --> infinity) saturation throughputs for each priority class.

The solar dynamo with meridional circulation

We show that meridional circulation can have a profound influence on dynamo models for the solar cycle. Motivated by the observed tilt angles of sunspot groups we assume that the generation of the poloidal field takes place near the surface, while a shear layer of radial differential rotation produces the toroidal field at the bottom of the convection zone. Both layers are coupled by a circulation with a poleward directed flow in the upper part and an equatorward flow in the deep layers of the convection zone. The circulation forces the toroidal field belts (which are responsible for the surface activity) to move equatorward. This leads to butterfly diagrams in qualitative agreement with the observations, even if the dynamo wave would propagate poleward in the absence of circulation. This result opens the possibility to construct models for the solar cycle which are based on observational data (tilt angles, differential rotation, and meridional circulation).

Redistribution Mechanisms for Assignment of Heterogeneous Objects

There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem satisfying weak budget balance, individual rationality, and minimizing the budget imbalance. This calls for designing an appropriate rebate function. When the objects are identical, this problem has been solved which we refer as WCO mechanism. We measure the performance of such mechanisms by the redistribution index. We first prove an impossibility theorem which rules out linear rebate functions with non-zero redistribution index in heterogeneous object assignment. Motivated by this theorem,we explore two approaches to get around this impossibility. In the first approach, we show that linear rebate functions with non-zero redistribution index are possible when the valuations for the objects have a certain type of relationship and we design a mechanism with linear rebate function that is worst case optimal. In the second approach, we show that rebate functions with non-zero efficiency are possible if linearity is relaxed. We extend the rebate functions of the WCO mechanism to heterogeneous objects assignment and conjecture them to be worst case optimal.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

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.

Robust Formulations for Handling Uncertainty in Kernel Matrices

We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we derive a formulation which is robust to such noise. The resulting formulation applies when the noise is Gaussian, or has finite support. The formulation in general is non-convex, but in several cases of interest it reduces to a convex program. The problem of uncertainty in kernel matrix is motivated from the real world problem of classifying proteins when the structures are provided with some uncertainty. The formulation derived here naturally incorporates such uncertainty in a principled manner leading to significant improvements over the state of the art. 1.

The restriction mapping problem revisited

In computational molecular biology, the aim of restriction mapping is to locate the restriction sites of a given enzyme on a DNA molecule. Double digest and partial digest are two well-studied techniques for restriction mapping. While double digest is NP-complete, there is no known polynomial-time algorithm for partial digest. Another disadvantage of the above techniques is that there can be multiple solutions for reconstruction. In this paper, we study a simple technique called labeled partial digest for restriction mapping. We give a fast polynomial time (O(n(2) log n) worst-case) algorithm for finding all the n sites of a DNA molecule using this technique. An important advantage of the algorithm is the unique reconstruction of the DNA molecule from the digest. The technique is also robust in handling errors in fragment lengths which arises in the laboratory. We give a robust O(n(4)) worst-case algorithm that can provably tolerate an absolute error of O(Delta/n) (where Delta is the minimum inter-site distance), while giving a unique reconstruction. We test our theoretical results by simulating the performance of the algorithm on a real DNA molecule. Motivated by the similarity to the labeled partial digest problem, we address a related problem of interest-the de novo peptide sequencing problem (ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 389-398), which arises in the reconstruction of the peptide sequence of a protein molecule. We give a simple and efficient algorithm for the problem without using dynamic programming. The algorithm runs in time O(k log k), where k is the number of ions and is an improvement over the algorithm in Chen et al. (C) 2002 Elsevier Science (USA). All rights reserved.

Full Sphere Axisymmetric Simulations of the Solar Dynamo

We explore a full sphere (2D axisymmetric) kinematic solar dynamo model based on the Babcock-Leighton idea that the poloidal field is generated in the surface layers from the decay of tilted bipolar solar active regions. This model incorporates the helioseismically deduced solar rotation profile and an algorithm for buoyancy motivated from simulations of flux tube dynamics. A prescribed deep meridional circulation plays an important role in the advection of magnetic flux. We specifically address the parity issue and show that – contrary to some recent claims – the Babcock-Leighton dynamo can reproduce solar-like dipolar parity if certain reasonable conditions are satisfied in the solar interior, the most important requirement being that the poloidal field of the two hemispheres be efficiently coupled across the equator.

On the Compressibility of non-Abelian-Group Sources in a Distributed Source Coding Setting

We consider the problem of compression of a non-Abelian source.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 often improve upon the compression rate required by the Slepian-Wolf bound. Let G be a non-Abelian group having center Z(G). We show here that it is impossible to compress a source with symbols drawn from G when Z(G) is trivial if one employs a homomorphic encoder and a typical-set decoder.We provide achievable upper bounds on the minimum rate required to compress a non-Abelian group with non-trivial center. Also, in a two source setting, we provide achievable upper bounds for compression of any non-Abelian group, using a non-homomorphic encoder.

Zero momentum gluons and the total pp and pbarp cross-sections

We describe a QCD motivated model for total cross-sections which uses the eikonal representation and incorporates QCD mini-jets to drive the rise with energy of the cross-section, while the impact parameter distribution is obtained through the Fourier transform of the transverse momentum distribution of soft gluons emitted in the parton-parton interactions giving rise to mini-jets in the final state. A singular but integral expression for the running coupling constant in the infrared region is part of this model.

An experimental study of boundary layer transition induced by a cylinder wake

Boundary layer transition induced by the wake of a circular cylinder in the free stream has been investigated using the particle image velocimetry technique. Some differences between simulation and experimental studies have been reported in the literature, and these have motivated the present study. The appearance of spanwise vortices in the early stage is further confirmed here. Lambda spanwise vortex appears to evolve into a Lambda/hairpin vortex; the flow statistics also confirm such vortices. With increasing Reynolds number, based on the cylinder diameter, and with decreasing cylinder height from the plate, the physical size of these hairpin-like structures is found to decrease. Some mean flow characteristics, including the streamwise growth of the disturbance energy, in a wake-induced transition resemble those in bypass transition induced by free stream turbulence. Streamwise velocity streaks that are eventually generated in the late stage often undergo sinuous-type oscillations. Similar to other transitional flows, an inclined shear layer in the wall-normal plane is often seen to oscillate and shed vortices. The normalized shedding frequency of these vortices, estimated from the spatial spacing and the convection velocity of these vortices, is found to be independent of the Reynolds number, similar to that in ribbon-induced transition. Although the nature of free stream disturbance in a wake-induced transition and that in a bypass transition are different, the late-stage features including the flow breakdown characteristics of these two transitions appear to be similar.

Network governance at local — A comparative approach

Factors influencing the effectiveness of democratic institutions and to that effect processes involved at the local governance level have been the interest in the literature, given the presence of various advocacies and networks that are context-specific. This paper is motivated to understand the adaptability issues related to governance given these complexities through a comparative analysis of diversified regions. We adopted a two-stage clustering along with regression methodology for this purpose. The results show that the formation of advocacies and networks depends on the context and institutional framework. The paper concludes by exploring different strategies and dynamics involved in network governance and insists on the importance of governing the networks for structural reformation through regional policy making.

Static balancing of a four-bar linkage and its cognates

Motivated by the need to statically balance the inherent elastic forces in linkages, this paper presents three techniques to statically balance a four-bar linkage loaded by a zero-free-length spring attached between its coupler point and an anchor point on the ground. The number of auxiliary links and balancing springs required for the three techniques is less than or equal to that of the only technique currently in the literature. One of the three techniques does not require auxiliary links. In these techniques, the set of values for the spring constants and the ground-anchor point of the balancing springs can vary over a one-parameter family. Thrice as many balancing choices are available when the cognates are considered. The ensuing numerous options enable a user to choose the most practical solution. To facilitate the evaluation of the balancing choices for all the cognates, Roberts-Chebyshev cognate theorem is extended to statically balanced four-bar linkages. (C) 2011 Elsevier Ltd. All rights reserved.