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.

Phase diagram of a two-species lattice model with a linear instability

We discuss the properties of a one-dimensional lattice model of a driven system with two species of particles in which the mobility of one species depends on the density of the other. This model was introduced by Lahiri and Ramaswamy (Phys. Rev. Lett., 79, 1150 (1997)) in the context of sedimenting colloidal crystals, and its continuum version was shown to exhibit an instability arising from linear gradient couplings. In this paper we review recent progress in understanding the full phase diagram of the model. There are three phases. In the first, the steady state can be determined exactly along a representative locus using the condition of detailed balance. The system shows phase separation of an exceptionally robust sort, termed strong phase separation, which survives at all temperatures. The second phase arises in the threshold case where the first species evolves independently of the second, but the fluctuations of the first influence the evolution of the second, as in the passive scalar problem. The second species then shows phase separation of a delicate sort, in which long-range order coexists with fluctuations which do not damp down in the large-size limit. This fluctuation-dominated phase ordering is associated with power law decays in cluster size distributions and a breakdown of the Porod law. The third phase is one with a uniform overall density, and along a representative locus the steady state is shown to have product measure form. Density fluctuations are transported by two kinematic waves, each involving both species and coupled at the nonlinear level. Their dissipation properties are governed by the symmetries of these couplings, which depend on the overall densities. In the most interesting case,, the dissipation of the two modes is characterized by different critical exponents, despite the nonlinear coupling.

Role of length scales on microwave thawing dynamics in 2D cylinders

Microwave (MW) thawing of 2D frozen cylinders exposed to uniform plane waves from one face, is modeled using the effective heat capacity formulation with the MW power obtained from the electric field equations. Computations are illustrated for tylose (23% methyl cellulose gel) which melts over a range of temperatures giving rise to a mushy zone. Within the mushy region the dielectric properties are functions of the liquid volume fraction. The resulting coupled, time dependent non-linear equations are solved using the Galerkin finite element method with a fixed mesh. Our method efficiently captures the multiple connected thawed domains that arise due to the penetration of MWs in the sample. For a cylinder of diameter D, the two length scales that control the thawing dynamics are D/D-p and D/lambda(m), where D-p and lambda(m) are the penetration depth and wavelength of radiation in the sample respectively. For D/D-p, D/lambda(m) much less than 1 power absorption is uniform and thawing occurs almost simultaneously across the sample (Regime I). For D/D-p much greater than 1 thawing is seen to occur from the incident face, since the power decays exponentially into the sample (Regime III). At intermediate values, 0.2 < D/D-p, D/lambda(m) < 2.0 (Regime II) thawing occurs from the unexposed face at smaller diameters, from both faces at intermediate diameters and from the exposed and central regions at larger diameters. Average power absorption during thawing indicates a monotonic rise in Regime I and a monotonic decrease in Regime III. Local maxima in the average power observed for samples in Regime II are due to internal resonances within the sample. Thawing time increases monotonically with sample diameter and temperature gradients in the sample generally increase from Regime I to Regime III. (C) 2002 Elsevier Science Ltd. All rights reserved.

A New Family of Soft Transition Converters: Design Example and Dynamic Model

The soft switching converters evolved through the resonant load, resonant switch, resonant transition and active clamp converters to eliminate switching losses in power converters. This paper briefly presents the operating principle of the new family of soft transition converters; the methodology of design of these converters is presented through an example. In the proposed family of converters, the switching transitions of both the main switch and auxiliary switch are lossless.When these converters are analysed in terms of the pole current and throw voltage, the defining equations of all converters belonging to this family become identical.Such a description allows one to define simple circuit oriented model for these converters. These circuit models help in evaluating the steady state and dynamic model of these converters. The standard dynamic performance functions of the converters are readily obtainable from this model. This paper presents these dynamic models and verifies the same through measurements on a prototype converter.

A new family of soft transition converters: Design and dynamic model

The soft switching converters evolved through the resonant load, resonant switch, resonant transition and active clamp converters to eliminate switching losses in power converters. This paper briefly presents the operating principle of the new family of soft transition converters; the methodology of design of these converters is presented through an example. In the proposed family of converters, the switching transitions of both the main switch and auxiliary switch are lossless. When these converters are analysed in terms of the pole current and throw voltage, the defining equations of all converters belonging to this family become identical.Such a description allows one to define simple circuit oriented model for these converters. These circuit models help in evaluating the steady state and dynamic model of these converters. The standard dynamic performance functions of the converters are readily obtainable from this model. This paper presents these dynamic models and verifies the same through measurements on a prototype converter.

Two-level Mapping Based Cache Index Selection for Packet Forwarding Engines

Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the placement function to reduce conflict misses. Traditional placement functions use a one-level mapping that naively partitions trie-nodes into cache sets. However, as a significant percentage of trie nodes are not useful, these schemes suffer from a non-uniform distribution of useful nodes to sets. This in turn results in increased conflict misses. Newer organizations such as variable associativity caches achieve flexibility in placement at the expense of increased hit-latency. This makes them unsuitable for L1 caches.We propose a novel two-level mapping framework that retains the hit-latency of one-level mapping yet incurs fewer conflict misses. This is achieved by introducing a secondlevel mapping which reorganizes the nodes in the naive initial partitions into refined partitions with near-uniform distribution of nodes. Further as this remapping is accomplished by simply adapting the index bits to a given routing table the hit-latency is not affected. We propose three new schemes which result in up to 16% reduction in the number of misses and 13% speedup in memory access time. In comparison, an XOR-based placement scheme known to perform extremely well for general purpose architectures, can obtain up to 2% speedup in memory access time.

Detection of a periodic structure embedded in surface roughness, for various correlation functions

This paper deals with surface profilometry, where we try to detect a periodic structure, hidden in randomness using the matched filter method of analysing the intensity of light, scattered from the surface. From the direct problem of light scattering from a composite rough surface of the above type, we find that the detectability of the periodic structure can be hindered by the randomness, being dependent on the correlation function of the random part. In our earlier works, we had concentrated mainly on the Cauchy-type correlation function for the rough part. In the present work, we show that this technique can determine the periodic structure of different kinds of correlation functions of the roughness, including Cauchy, Gaussian etc. We study the detection by the matched filter method as the nature of the correlation function is varied.

Output-Sensitive Construction of Reeb Graphs

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications-surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.

Variable Granularity Access Tracking Scheme for Improving the Performance of Software Transactional Memory

Software transactional memory (STM) has been proposed as a promising programming paradigm for shared memory multi-threaded programs as an alternative to conventional lock based synchronization primitives. Typical STM implementations employ a conflict detection scheme, which works with uniform access granularity, tracking shared data accesses either at word/cache line or at object level. It is well known that a single fixed access tracking granularity cannot meet the conflicting goals of reducing false conflicts without impacting concurrency adversely. A fine grained granularity while improving concurrency can have an adverse impact on performance due to lock aliasing, lock validation overheads, and additional cache pressure. On the other hand, a coarse grained granularity can impact performance due to reduced concurrency. Thus, in general, a fixed or uniform granularity access tracking (UGAT) scheme is application-unaware and rarely matches the access patterns of individual application or parts of an application, leading to sub-optimal performance for different parts of the application(s). In order to mitigate the disadvantages associated with UGAT scheme, we propose a Variable Granularity Access Tracking (VGAT) scheme in this paper. We propose a compiler based approach wherein the compiler uses inter-procedural whole program static analysis to select the access tracking granularity for different shared data structures of the application based on the application's data access pattern. We describe our prototype VGAT scheme, using TL2 as our STM implementation. Our experimental results reveal that VGAT-STM scheme can improve the application performance of STAMP benchmarks from 1.87% to up to 21.2%.

Reactive pulsed laser deposition and characterization of niobium nitride thin films

We present a systematic study to explore the effect of important process variables on the composition and structure of niobium nitride thin films synthesized by Reactive Pulsed Laser Deposition (RPLD) technique through ablation of high purity niobium target in the presence of low pressure nitrogen gas. Secondary Ion Mass Spectrometry has been used in a unique way to study and fix gas pressure, substrate temperature and laser fluence, in order to obtain optimized conditions for one variable in single experimental run. The x-ray diffraction and electron microscopic characterization have been complemented by proton elastic backscattering spectroscopy and x-ray photoelectron spectroscopy to understand the incorporation of oxygen and associated non-stoichiometry in the metal to nitrogen ratio. The present study demonstrates that RPLD can be used for obtaining thin film architectures using non-equilibrium processing. Finally the optimized NbN thin films were characterized for their hardness using nano-indentation technique and found to be similar to 30 GPa at the deposition pressure of 8 Pa. (C) 2011 Elsevier B.V. All rights reserved.

An Algorithm for Testing 2-Asummability of Boolean Functions

Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables.

Chemistry and biology of DNA-binding small molecules

Regulation of the transcription machinery is one of the many ways to achieve control of gene expression. This has been done either at the transcription initiation stage or at the elongation stage. Different methodologies are known to inhibit transcription initiation via targeting of double-stranded (ds) DNA by: (i) synthetic oligonucleotides, (ii) ds-DNA-specific, sequenceselective minor-groove binders (distamycin A), intercalators (daunomycin) combilexins and (iii) small molecule (peptide or intercalator)-oligonucleotide conjugates. In some cases, instead of ds-DNA, higher order G-quadruplex structures are formed at the start site of transcription. In this regard G-quadruplex DNA-specific small molecules play a significant role towards inhibition of the transcription machinery. Different types of designer DNA-binding agents act as powerful sequence-specific gene modulators, by exerting their effect from transcription regulation to gene modification. But most of these chemotherapeutic agents have serious side effects. Accordingly, there is always a challenge to design such DNA-binding molecules that should not only achieve maximum specific DNA-binding affinity, and cellular and nuclear transport activity, but also would not interfere with the functions of normal cells.

Parallel Computation of 3D Morse-Smale Complexes

The Morse-Smale complex is a topological structure that captures the behavior of the gradient of a scalar function on a manifold. This paper discusses scalable techniques to compute the Morse-Smale complex of scalar functions defined on large three-dimensional structured grids. Computing the Morse-Smale complex of three-dimensional domains is challenging as compared to two-dimensional domains because of the non-trivial structure introduced by the two types of saddle criticalities. We present a parallel shared-memory algorithm to compute the Morse-Smale complex based on Forman's discrete Morse theory. The algorithm achieves scalability via synergistic use of the CPU and the GPU. We first prove that the discrete gradient on the domain can be computed independently for each cell and hence can be implemented on the GPU. Second, we describe a two-step graph traversal algorithm to compute the 1-saddle-2-saddle connections efficiently and in parallel on the CPU. Simultaneously, the extremasaddle connections are computed using a tree traversal algorithm on the GPU.

Additional role for the ccd operon of F-plasmid as a transmissible persistence factor

Toxin-antitoxin (TA) systems are found on both bacterial plasmids and chromosomes, but in most cases their functional role is unclear. Gene knockouts often yield limited insights into functions of individual TA systems because of their redundancy. The well-characterized F-plasmid-based CcdAB TA system is important for F-plasmid maintenance. We have isolated several point mutants of the toxin CcdB that fail to bind to its cellular target, DNA gyrase, but retain binding to the antitoxin, CcdA. Expression of such mutants is shown to result in release of the WT toxin from a functional preexisting TA complex as well as derepression of the TA operon. One such inactive, active-site mutant of CcdB was used to demonstrate the contribution of CcdB to antibiotic persistence. Transient activation of WT CcdB either by coexpression of the mutant or by antibiotic/heat stress was shown to enhance the generation of drug-tolerant persisters in a process dependent on Lon protease and RecA. An F-plasmid containing a ccd locus can, therefore, function as a transmissible persistence factor.

SCALE EFFECTS ON ULTRASONIC WAVE DISPERSION CHARACTERISTICS OF MONOLAYER GRAPHENE EMBEDDED IN AN ELASTIC MEDIUM

Ultrasonic wave propagation in a graphene sheet, which is embedded in an elastic medium, is studied using nonlocal elasticity theory incorporating small-scale effects. The graphene sheet is modeled as an one-atom thick isotropic plate and the elastic medium/substrate is modeled as distributed springs. For this model, the nonlocal governing differential equations of motion are derived from the minimization of the total potential energy of the entire system. After that, an ultrasonic type of wave propagation model is also derived. The explicit expressions for the cut-off frequencies are also obtained as functions of the nonlocal scaling parameter and the y-directional wavenumber. Local elasticity shows that the wave will propagate even at higher frequencies. But nonlocal elasticity predicts that the waves can propagate only up to certain frequencies (called escape frequencies), after which the wave velocity becomes zero. The results also show that the escape frequencies are purely a function of the nonlocal scaling parameter. The effect of the elastic medium is captured in the wave dispersion analysis and this analysis is explained with respect to both local and nonlocal elasticity. The simulations show that the elastic medium affects only the flexural wave mode in the graphene sheet. The presence of the elastic matrix increases the band gap of the flexural mode. The present results can provide useful guidance for the design of next-generation nanodevices in which graphene-based composites act as a major element.