Elastic-plastic contact conditions for frictionally constrained bodies under cyclic tangential loading

A Frictionally constrained condition implies dependence of friction force on tangential displacement amplitude. The condition may occur due to chemical, physical, and/or mechanical interaction between the contacting surfaces. The condition, sometimes also referred to as the presliding condition or partial slip condition, is characterized under fretting. Under such conditions, various experimental studies indicate the existence of two distinguishable regions, that is, stick region and slip region. In the present study, frictionally constrained conditions are identified and the evolutions of stick-slip regions are investigated in detail. Investigations have been performed on self-mated stainless steel and chromium carbide coated surfaces mated against stainless steel, under both vacuum and ambient conditions. Contact conditions prevailing at the contact interface were identified based on the mechanical responses and were correlated with the surface damage observed. Surface degradation has been observed in the form of microcracks and material transfer. Detailed numerical analysis has also been performed in order to understand the energy dissipation and the damage mode involved in the surface or subsurface damage. It has been observed that under frictionally constrained conditions, the occurrence of annular slip features are mainly due to the junction growth, resulting from elastic-plastic deformation at the contact interface. Ratcheting has been observed as the governing damage mode under cyclic tangential loading condition.

Improved perfect space-time block codes

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

Asymptotically-good, multigroup decodable space-time block codes

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

Role of melt convection on optimization of PCM-based heat sink under cyclic heat load

In this article, we study the thermal performance of phase-change material (PCM)-based heat sinks under cyclic heat load and subjected to melt convection. Plate fin type heat sinks made of aluminum and filled with PCM are considered in this study. The heat sink is heated from the bottom. For a prescribed value of heat flux, design of such a heat sink can be optimized with respect to its geometry, with the objective of minimizing the temperature rise during heating and ensuring complete solidification of PCM at the end of the cooling period for a given cycle. For given length and base plate thickness of a heat sink, a genetic algorithm (GA)-based optimization is carried out with respect to geometrical variables such as fin thickness, fin height, and the number of fins. The thermal performance of the heat sink for a given set of parameters is evaluated using an enthalpy-based heat transfer model, which provides the necessary data for the optimization algorithm. The effect of melt convection is studied by taking two cases, one without melt convection (conduction regime) and the other with convection. The results show that melt convection alters the results of geometrical optimization.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

Regenerating codes: A reformulated storage-bandwidth trade-off and a new construction

In this paper, the storage-repair-bandwidth (SRB) trade-off curve of regenerating codes is reformulated to yield a tradeoff between two global parameters of practical relevance, namely information rate and repair rate. The new information-repair-rate (IRR) tradeoff provides a different and insightful perspective on regenerating codes. For example, it provides a new motivation for seeking to investigate constructions corresponding to the interior of the SRB tradeoff. Interestingly, each point on the SRB tradeoff corresponds to a curve in the IRR tradeoff setup. We characterize completely, functional repair under the IRR framework, while for exact repair, an achievable region is presented. In the second part of this paper, a rate-half regenerating code for the minimum storage regenerating point is constructed that draws upon the theory of invariant subspaces. While the parameters of this rate-half code are the same as those of the MISER code, the construction itself is quite different.

Fast-Decodable MIDO Codes With Large Coding Gain

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 x 2, 6 x 2, 8 x 2, and 12 x 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 x 2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4x2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 x 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 x 2 system.

The influence of mesoporous silica in low T-g cyclic olefin copolymer nanocomposite films: Mechanical and moisture barrier studies

In this study, mesoporous silica-cyclic olefin copolymer nanocomposite films were fabricated by solution casting. With an increase in silica loading, the stiffness of the matrix increased. The nanocomposite film shows increased strain to failure with moisture after aging by matrix plasticization. The storage modulus and loss factor for samples with silica content show better results compared with pristine polymer, as indicated by dynamic mechanical analysis. The interaction between filler-polymer chain exhibit hydrophobicity compared to the neat polymer. Water absorption studies at room temperature and near the T-g of the polymer (similar to 64 degrees C) were carried out. The nanocomposites up to 4 wt% filler reduces the water diffusion by forming hydrogen and chemical bonding. The result by calcium degradation test method for moisture permeability and Schottky structured organic device encapsulation under weathering condition confirms the effective reinforcement effect of silica particles in the matrix. (C) 2014 Elsevier Ltd. All rights reserved.

Conformational Analysis of a 20-Membered Cyclic Peptide Disulfide from Conus virgo with a WPW Segment: Evidence for an Aromatic-Proline Sandwich

A novel peptide containing a single disulfide bond, CIWPWC (Vi804), has been isolated and characterised from the venom of the marine cone snail, Conus virgo. A precursor polypeptide sequence derived from complementary DNA, corresponding to the M-superfamily conotoxins, has been identified. The identity of the synthetic and natural peptide sequence has been established. A detailed analysis of the conformation in solution is reported for Vi804 and a synthetic analogue, (CIWPWC)-W-D ((D)W3-Vi804), in order to establish the structure of the novel WPW motif, which occurs in the context of a 20-membered macrocyclic disulfide. Vi804 exists exclusively in the cis W3P4 conformer in water and methanol, whereas (D)W3-Vi804 occurs exclusively as the trans conformer. NMR spectra revealed a W3P4 typeVI turn in Vi804 and a typeII turn in the analogue peptide, (D)W3-Vi804. The extremely high-field chemical shifts of the proline ring protons, together with specific nuclear Overhauser effects, are used to establish a conformation in which the proline ring is sandwiched between the flanking Trp residues, which emphasises a stabilising role for the aromatic-proline interactions, mediated predominantly by dispersion forces.

Tonic current through GABAA receptors and hyperpolarization-activated cyclic nucleotide-gated channels modulate resonance properties of rat subicular pyramidal neurons

The subiculum, considered to be the output structure of the hippocampus, modulates information flow from the hippocampus to various cortical and sub-cortical areas such as the nucleus accumbens, lateral septal region, thalamus, nucleus gelatinosus, medial nucleus and mammillary nuclei. Tonic inhibitory current plays an important role in neuronal physiology and pathophysiology by modulating the electrophysiological properties of neurons. While the alterations of various electrical properties due to tonic inhibition have been studied in neurons from different regions, its influence on intrinsic subthreshold resonance in pyramidal excitatory neurons expressing hyperpolarization-activated cyclic nucleotide-gated (HCN) channels is not known. Using pharmacological agents, we show the involvement of alpha 5 beta gamma GABA(A) receptors in the picrotoxin-sensitive tonic current in subicular pyramidal neurons. We further investigated the contribution of tonic conductance in regulating subthreshold electrophysiological properties using current clamp and dynamic clamp experiments. We demonstrate that tonic GABAergic inhibition can actively modulate subthreshold properties, including resonance due to HCN channels, which can potentially alter the response dynamics of subicular pyramidal neurons in an oscillating neuronal network.

Backbone-modified amphiphilic cyclic di- and tetrasaccharides

Synthesis of amphiphilic, cyclic di- and tetrasaccharides, which incorporate a methylene moiety at the inter-glycosidic bond, is reported. The amphiphilic properties of the new cyclic tetrasaccharide host were identified through assessing the solubilities of guests in aqueous and in organic solvents. The glycosidic bond stability of the cyclic tetrasaccharide under aqueous acidic condition was also verified.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Upper Bounds on the Size of Grain-Correcting Codes

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

beta gamma-fused turn structures in sugar amino acid (SAA) containing cyclic tetrapeptides with alpha 3 delta architecture

The current manuscript describes conformational analysis of 15-membered cyclic tetrapeptides (CTPs), with alpha 3 delta architecture, containing sugar amino acids (SAA) having variation in the stereocenter at C5 carbon. Conformational analyses of both the series, in protected and deprotected forms, were carried out in DMSO-d(6) using various NMR techniques, supported by restrained MD calculations. It was intriguing to notice that the alpha 3 delta macrocycles got stabilized by both 10-membered beta-turn as well as a seven-membered gamma-turn, fused within the same macrocycle. The presence of fused sub-structures within a 15-membered macrocycle is rare to see. Also, the stereocenter variation at C5 did not affect the fused turn structures and exhibited similar conformations in both the series. The design becomes highly advantageous as fused reverse turn structures are occurring in the cyclic structure with minimalistic size macrocycle and this can be applied to develop suitable pharmacophores in the drug development process. (C) 2014 Elsevier Ltd. All rights reserved.

One-pot synthesis of functionalized beta-amino sulfides/beta-amino selenides via ring opening of cyclic sulfamidates

A number of functionalized beta-amino and gamma-amino sulfides and selenides have been synthesized involving a one-pot process of ring opening of cyclic sulfamidates with `in situ' generated thiolate and selenoate species from diaryl disulfides and diphenyl diselenide using rongalite. A mild and efficient method has been developed for the synthesis of cysteines from serine.