Algorithms based on DQM with new sets of base functions for solving parabolic partial differential equations in (2+1)(2+1) dimension

This paper deals with the numerical computations of two space dimensional time dependent parabolic partial differential equations by adopting adopting an optimal five stage fourth-order strong stability preserving Runge Kutta (SSP-RK54) scheme for time discretization, and three methods of differential quadrature with different sets of modified B-splines as base functions, for space discretization: namely i) mECDQM: (DQM with modified extended cubic B-splines); ii) mExp-DQM: DQM with modified exponential cubic B-splines, and iii) MTB-DQM: DQM with modified trigonometric cubic B-splines. Specially, we implement these methods on convection-diffusion equation to convert them into a system of first order ordinary differential equations,in time which can be solved using any time integration method, while we prefer SSP-RK54 scheme. All the three methods are found stable for two space convection-diffusion equation by employing matrix stability analysis method. The accuracy and validity of the methods are confirmed by three test problems of two dimensional convection-diffusion equation, which shows that the proposed approximate solutions by any of the method are in good agreement with the exact solutions

Lipid-protein interaction induced domains: kinetics and conformational changes in multicomponent vesicles

The spatio-temporal organization of proteins and the associated morphological changes in membranes are of importance in cell signaling. Several mechanisms that promote the aggregation of proteins at low cell surface concentrations have been investigated in the past. We show, using Monte Carlo simulations, that the affinity of proteins for specific lipids can hasten its aggregation kinetics. The lipid membrane is modeled as a dynamically triangulated surface with the proteins defined as in-plane fields at the vertices. We show that, even at low protein concentrations, strong lipid-protein interactions can result in large protein clusters indicating a route to lipid mediated signal amplification. At high protein concentrations the domains form buds similar to that seen in lipid-lipid interaction induced phase separation. Protein interaction induced domain budding is suppressed when proteins act as anisotropic inclusions and exhibit nematic orientational order. The kinetics of protein clustering and resulting conformational changes are shown to be significantly different for the isotropic and anisotropic curvature inducing proteins.Comment: 22pages, 12 figure

New relativistic effective interaction for finite nuclei, infinite nuclear matter and neutron stars

We carry out the study for finite nuclei, infinite nuclear matter and neutron star properties with the newly developed relativistic force named as the Institute Of Physics Bhubaneswar-I(IOPB-I). Using this force, we calculate the binding energies, charge radii and neutron skin thickness for some selected nuclei. From the ground state properties of superheavy element i.e. Z=120, it is noticed that considerable shell gaps appear at neutron numbers N=172, 184 and 198, showing the magicity of these numbers. The low density behavior of the equation of state for pure neutron matter is compatible with other microscopic models. Along with the nuclear symmetry energy, its slope and curvature parameters at the saturation density are consistent with those extracted from various experimental data. We calculate the neutron star properties with the equation of state composed of nucleons and leptons in $\it beta-equilibrium$ which are in good agreement with the X-ray observations by Steiner and N\"{a}ttil\"{a}. We find that the maximum mass of the neutron star to be 2.15$M_{\odot}$ and stellar radius 11.936 km . Moreover, the radius and tidal deformability of a {\it canonical} neutron star mass 1.4$M_\odot$ come out to be 13.242 km and 3.910$\times$10$^{36}$ g cm$^2$ s$^2$ respectively within this parameter set.Comment: 17 pages, 9 figures and comments are welcom

Redundancy Allocation of Partitioned Linear Block Codes

Most memories suffer from both permanent defects and intermittent random errors. The partitioned linear block codes (PLBC) were proposed by Heegard to efficiently mask stuck-at defects and correct random errors. The PLBC have two separate redundancy parts for defects and random errors. In this paper, we investigate the allocation of redundancy between these two parts. The optimal redundancy allocation will be investigated using simulations and the simulation results show that the PLBC can significantly reduce the probability of decoding failure in memory with defects. In addition, we will derive the upper bound on the probability of decoding failure of PLBC and estimate the optimal redundancy allocation using this upper bound. The estimated redundancy allocation matches the optimal redundancy allocation well.Comment: 5 pages, 2 figures, to appear in IEEE International Symposium on Information Theory (ISIT), Jul. 201

Approximation of Entropy Numbers

The purpose of this article is to develop a technique to estimate certain bounds for entropy numbers of diagonal operator on spaces of p-summable sequences for finite p greater than 1. The approximation method we develop in this direction works for a very general class of operators between Banach spaces, in particular reflexive spaces. As a consequence of this technique we also obtain that the entropy number of a bounded linear operator T between two separable Hilbert spaces is equal to the entropy number of the adjoint of T. This gives a complete answer to the question posed by B. Carl [4] in the setting of separable Hilbert spaces.Comment: 10 page

Duality between erasures and defects

We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the original message. In addition, the relations between BEC, BDC, binary erasure quantization (BEQ), and write-once memory (WOM) are described. From these relations we claim that the capacity of the BDC can be achieved by Reed-Muller (RM) codes under maximum a posterior (MAP) decoding. Also, polar codes with a successive cancellation encoder achieve the capacity of the BDC. Inspired by the duality between the BEC and the BDC, we introduce locally rewritable codes (LWC) for resistive memories, which are the counterparts of locally repairable codes (LRC) for distributed storage systems. The proposed LWC can improve endurance limit and power efficiency of resistive memories.Comment: Presented at Information Theory and Applications (ITA) Workshop 2016. arXiv admin note: text overlap with arXiv:1602.0120

INSDOC’S contribution to bibliometrics

Traces the history of bibliometric research, training and activities in INSDOC. Describes briefly the objectives, facilities, services, research activities, and publications of National Centre on Bibliometrics