Codes for solving three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces

Three codes, that can solve three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces, are provided here. The file 'bemconst.m' contains a MATLAB code for solving three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces. The file 'bemconst.f90' is a Fortran translation of the MATLAB code contained in the file 'bemconst.m'. The file 'bemconstp.f90' is a parallelized version of the Fortran code contained in the file 'bemconst.f90'. The file 'inbem96.txt' is the input file for the Fortran codes contained in the files 'bemconst.f90' and 'bemconstp.f90'. Author hereby declares that the present codes are the original works of the author. Further, author hereby declares that any of the present codes, in full or in part, is not a translation or a copy of any of the existing codes written by someone else. Author's institution (Indian Institute of Science) has informed the author in writing that the institution is not interested in claiming any copyright on the present codes. Author is hereby distributing the present codes under the MIT License; full text of the license is included in each of the files that contain the codes.

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.

Remarkable Regioisomer Control in the Hydrogel Formation from a Two-Component Mixture of Pyridine-End Oligo(p-phenylenevinylene)s and N-Decanoyl-L-alanine

N-Decanoyl-L-alanine (DA) was mixed with either colorless 4,4-bipyridine (BP) or various derivatives such as chromogenic oligo(p-phenylenevinylene) (OPV) functionalized with isomeric pyridine termini in specific molar ratios. This mixtures form salt-type gels in a water/ethanol (2:1, v/v) mixture. The gelation properties of these two-component mixtures could be modulated by variation of the position of the N atom of the end pyridyl groups in OPVs. The presence of acid-base interactions in the self-assembly of these two-component systems leading to gelation was probed in detail by using stoichiometry-dependent UV/Vis and FTIR spectroscopy. Furthermore, temperature-dependent UV/Vis and fluorescence spectroscopy clearly demonstrated a J-type aggregation mode of these gelator molecules during the sol-to-gel transition process. Morphological features and the arrangement of the molecules in the gels were examined by using scanning electron microscopy (SEM), atomic force microscopy (AFM), and X-ray diffraction (XRD) techniques. Calculation of the length of each molecular system by energy minimization in its extended conformation and comparison with the XRD patterns revealed that this class of gelator molecules adopts lamellar organizations. Rheological properties of these two-component systems provided clear evidence that the flow behavior could be modulated by varying the acid/amine ratio. Polarized optical microscopy (POM), differential scanning calorimetry (DSC), and XRD results revealed that the solid-phase behavior of such two-component mixtures (acid/base=2:1) varied significantly upon changing the proton-acceptor part from BP to OPV. Interestingly, the XRD pattern of these acid/base mixtures after annealing at their associated isotropic temperature was significantly different from that of their xerogels.

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.

Influence of exhaust gas heating and L/D ratios on the discharge efficiencies for an activated carbon natural gas storage system

A transient 2D axi-symmetric and lumped parameter (LP) model with constant outflow conditions have been developed to study the discharge capacity of an activated carbon bed. The predicted discharge times and variations in bed pressure and temperature are in good agreement with experimental results obtained from a 1.82 l adsorbed natural gas (ANG) storage system. Under ambient air conditions, a maximum temperature drop of 29.5 K and 45.5 K are predicted at the bed center for discharge rates of 1.0 l min(-1) and 5.0 l min(-1) respectively. The corresponding discharge efficiencies are 77% and 71.5% respectively with discharge efficiencies improving with decreasing outflow rates. Increasing the LID ratio from 1.9 to 7.8 had only a marginal increase in the discharge efficiency. Forced convection (exhaust gas) heating had a significant effect on the discharge efficiency, leading to efficiencies as high as 92.8% at a discharge of 1.0 l min(-1) and 88.7% at 5 l min(-1). Our study shows that the LP model can be reliably used to obtain discharge times due to the uniform pressure distributions in the bed. Temperature predictions with the LP model were more accurate at ambient conditions and higher discharge rates, due to greater uniformity in bed temperatures. For the low thermal conductivity carbon porous beds, our study shows that exhaust gas heating can be used as an effective and convenient strategy to improve the discharge characteristics and performance of an ANG system. (C) 2013 Elsevier Ltd. All rights reserved.

Performance evaluation of typical approximation algorithms for nonconvex l(p)-minimization in diffuse optical tomography

The sparse estimation methods that utilize the l(p)-norm, with p being between 0 and 1, have shown better utility in providing optimal solutions to the inverse problem in diffuse optical tomography. These l(p)-norm-based regularizations make the optimization function nonconvex, and algorithms that implement l(p)-norm minimization utilize approximations to the original l(p)-norm function. In this work, three such typical methods for implementing the l(p)-norm were considered, namely, iteratively reweighted l(1)-minimization (IRL1), iteratively reweighted least squares (IRLS), and the iteratively thresholding method (ITM). These methods were deployed for performing diffuse optical tomographic image reconstruction, and a systematic comparison with the help of three numerical and gelatin phantom cases was executed. The results indicate that these three methods in the implementation of l(p)-minimization yields similar results, with IRL1 fairing marginally in cases considered here in terms of shape recovery and quantitative accuracy of the reconstructed diffuse optical tomographic images. (C) 2014 Optical Society of America

Ferrocenyl-L-amino acid copper(II) complexes showing remarkable photo-induced anticancer activity in visible light

Ferrocene-conjugated copper(II) complexes Cu(Fc-aa)(aip)](ClO4) (1-3) and (Cu(Fc-aa)(pyip)](ClO4) (4-6) of L-amino acid reduced Schiff bases (Fc-aa), 2-(9-anthryl)-1H-imidazo4,5-f]1,10]phenanthroline (aip) and 2-(1-pyrenyl)-1H-imidazo4,5-f] 1,10]phenanthroline (pyip), where Fc-aa is ferrocenylmethyl-L-tyrosine (Fc-Tyr in 1, 4), ferrocenylmethyl-L-tryptophan (Fc-Trp in 2, 5) and ferrocenylmethyl-L-methionine (Fc-Met in 3, 6), were prepared and characterized, and their photocytotoxicity was studied (Fc = ferrocenyl moiety). Phenyl analogues, viz. (Cu(Ph-Met)(aip)](ClO4) (7) and (Cu(Ph-Met)(pyip)](ClO4) (8), were prepared and used as control compounds. The bis-imidazophenanthroline copper(II) complexes, viz. (Cu(aip)(2)(NO3)](NO3) (9) and Cu(pyip)(2)(NO3)](NO3) (10), were also prepared and used as controls. Complexes 1-6 having a redox inactive cooper(II) center showed the Fc(+)-Fc redox couple at similar to 0.5 V vs. SCE in DMF-0.1 mol (Bu4N)-N-n](ClO4). The copper(II)-based d-d band was observed near 600 nm in DMF-Tris-HCl buffer (1 :1 v/v). The ferrocenyl complexes showed low dark toxicity, but remarkably high photocytotoxicity in human cervical HeLa and human breast adenocarcinoma MCF-7 cancer cells giving an excellent photo-dynamic effect while their phenyl analogues were inactive. The photo-exposure caused significant morphological changes in the cancer cells when compared to the non-irradiated ones. The photophysical processes were rationalized from the theoretical studies. Fluorescence microscopic images showed 3 and 6 localizing predominantly in the endoplasmic reticulum (ER) of the cancer cells, thus minimizing any undesirable effects involving nuclear DNA.

L-p-Integrability, Dimensions of Supports of Fourier Transforms and Applications

It is proved that there does not exist any non zero function in with if its Fourier transform is supported by a set of finite packing -measure where . It is shown that the assertion fails for . The result is applied to prove L-p Wiener Tauberian theorems for R-n and M(2).

Role of the loop L-4,L-5 in allosteric regulation in mtHsp70s: in vivo significance of domain communication and its implications in protein translocation

Mitochondrial Hsp70 (mtHsp70) is essential for a vast repertoire of functions, including protein import, and requires effective interdomain communication for efficient partner-protein interactions. However, the in vivo functional significance of allosteric regulation in eukaryotes is poorly defined. Using integrated biochemical and yeast genetic approaches, we provide compelling evidence that a conserved substrate-binding domain (SBD) loop, L-4,L-5, plays a critical role in allosteric communication governing mtHsp70 chaperone functions across species. In yeast, a temperature-sensitive L-4,L-5 mutation (E467A) disrupts bidirectional domain communication, leading to compromised protein import and mitochondrial function. Loop L-4,L-5 functions synergistically with the linker in modulating the allosteric interface and conformational transitions between SBD and the nucleotide-binding domain (NBD), thus regulating interdomain communication. Second-site intragenic suppressors of E467A isolated within the SBD suppress domain communication defects by conformationally altering the allosteric interface, thereby restoring import and growth phenotypes. Strikingly, the suppressor mutations highlight that restoration of communication from NBD to SBD alone is the minimum essential requirement for effective in vivo function when primed at higher basal ATPase activity, mimicking the J-protein-bound state. Together these findings provide the first mechanistic insights into critical regions within the SBD of mtHsp70s regulating interdomain communication, thus highlighting its importance in protein translocation and mitochondrial biogenesis.

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.