Corporate social responsibilities of Indian public sector enterprises-a case study of Bharat Heavy Electricals Limited (BHEL)

The high level of public accountability attached to Public Sector Enterprises as a result of public ownership makes them socially responsible. The Committee of Public Undertakings in 1992 examined the issue relating to social obligations of Central Public Sector Enterprises and observed that ``being part of the `State', every Public Sector enterprise has a moral responsibility to play an active role in discharging the social obligations endowed on a welfare state, subject to the financial health of the enterprise''. It issued the Corporate Social Responsibility Guidelines in 2010 where all Central Public Enterprises, through a Board Resolution, are mandated to create a CSR budget as a specified percentage of net profit of the previous year. This paper examines the CSR activities of the biggest engineering public sector organization in India, Bharath Heavy Electricals Limited. The objectives are twofold, one, to develop a case study of the organization about the funds allocated and utilized for various CSR activities, and two, to examine its status with regard to other organizations, the 2010 guidelines, and the local socio-economic development. Secondary data analysis results show three interesting trends. One, it reveals increasing organizational social orientation with the formal guidelines in place. Two, Firms can no longer continue to exploit environmental resources and escape from their responsibilities by acting separate entities regardless of the interest of the society and Three the thrust of CSR in public sector is on inclusive growth, sustainable development and capacity building with due attention to the socio-economic needs of the neglected and marginalized sections of the society.

Physical Layer Network Coding for the K-User Multiple Access Relay Channel

We propose a Physical layer Network Coding (PNC) scheme for the K-user wireless Multiple Access Relay Channel, in which K source nodes want to transmit messages to a destination node D with the help of a relay node R. The proposed scheme involves (i) Phase 1 during which the source nodes alone transmit and (ii) Phase 2 during which the source nodes and the relay node transmit. At the end of Phase 1, the relay node decodes the messages of the source nodes and during Phase 2 transmits a many-to-one function of the decoded messages. To counter the error propagation from the relay node, we propose a novel decoder which takes into account the possibility of error events at R. It is shown that if certain parameters are chosen properly and if the network coding map used at R forms a Latin Hypercube, the proposed decoder offers the maximum diversity order of two. Also, it is shown that for a proper choice of the parameters, the proposed decoder admits fast decoding, with the same decoding complexity order as that of the reference scheme based on Complex Field Network Coding (CFNC). Simulation results indicate that the proposed PNC scheme offers a large gain over the CFNC scheme.

Temporal Envelope Fit of Transient Audio Signals

We address the problem of temporal envelope modeling for transient audio signals. We propose the Gamma distribution function (GDF) as a suitable candidate for modeling the envelope keeping in view some of its interesting properties such as asymmetry, causality, near-optimal time-bandwidth product, controllability of rise and decay, etc. The problem of finding the parameters of the GDF becomes a nonlinear regression problem. We overcome the hurdle by using a logarithmic envelope fit, which reduces the problem to one of linear regression. The logarithmic transformation also has the feature of dynamic range compression. Since temporal envelopes of audio signals are not uniformly distributed, in order to compute the amplitude, we investigate the importance of various loss functions for regression. Based on synthesized data experiments, wherein we have a ground truth, and real-world signals, we observe that the least-squares technique gives reasonably accurate amplitude estimates compared with other loss functions.

Extension of TSVM to multi-class and hierarchical text classification problems With general losses

Transductive SVM (TSVM) is a well known semi-supervised large margin learning method for binary text classification. In this paper we extend this method to multi-class and hierarchical classification problems. We point out that the determination of labels of unlabeled examples with fixed classifier weights is a linear programming problem. We devise an efficient technique for solving it. The method is applicable to general loss functions. We demonstrate the value of the new method using large margin loss on a number of multi-class and hierarchical classification datasets. For maxent loss we show empirically that our method is better than expectation regularization/constraint and posterior regularization methods, and competitive with the version of entropy regularization method which uses label constraints.

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.

Measurement Based Impromptu Deployment of a Multi-Hop Wireless Relay Network

We study the problem of optimal sequential (''as-you-go'') deployment of wireless relay nodes, as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for connecting a packet source to be placed at the end of the line with a sink node located at the starting point, to operate in the light traffic regime. In walking from the sink towards the source, at every step, measurements yield the transmit powers required to establish links to one or more previously placed nodes. Based on these measurements, at every step, a decision is made to place a relay node, the overall system objective being to minimize a linear combination of the expected sum power (or the expected maximum power) required to deliver a packet from the source to the sink node and the expected number of relay nodes deployed. For each of these two objectives, two different relay selection strategies are considered: (i) each relay communicates with the sink via its immediate previous relay, (ii) the communication path can skip some of the deployed relays. With appropriate modeling assumptions, we formulate each of these problems as a Markov decision process (MDP). We provide the optimal policy structures for all these cases, and provide illustrations of the policies and their performance, via numerical results, for some typical parameters.

Filling-in Void and Sparse Regions in Protein Sequence Space by Protein-Like Artificial Sequences Enables Remarkable Enhancement in Remote Homology Detection Capability

Protein functional annotation relies on the identification of accurate relationships, sequence divergence being a key factor. This is especially evident when distant protein relationships are demonstrated only with three-dimensional structures. To address this challenge, we describe a computational approach to purposefully bridge gaps between related protein families through directed design of protein-like ``linker'' sequences. For this, we represented SCOP domain families, integrated with sequence homologues, as multiple profiles and performed HMM-HMM alignments between related domain families. Where convincing alignments were achieved, we applied a roulette wheel-based method to design 3,611,010 protein-like sequences corresponding to 374 SCOP folds. To analyze their ability to link proteins in homology searches, we used 3024 queries to search two databases, one containing only natural sequences and another one additionally containing designed sequences. Our results showed that augmented database searches showed up to 30% improvement in fold coverage for over 74% of the folds, with 52 folds achieving all theoretically possible connections. Although sequences could not be designed between some families, the availability of designed sequences between other families within the fold established the sequence continuum to demonstrate 373 difficult relationships. Ultimately, as a practical and realistic extension, we demonstrate that such protein-like sequences can be ``plugged-into'' routine and generic sequence database searches to empower not only remote homology detection but also fold recognition. Our richly statistically supported findings show that complementary searches in both databases will increase the effectiveness of sequence-based searches in recognizing all homologues sharing a common fold. (C) 2013 Elsevier Ltd. All rights reserved.

Boron doped defective graphene as a potential anode material for Li-ion batteries

Graphene with large surface area and robust structure has been proposed as a high storage capacity anode material for Li ion batteries. While the inertness of pristine graphene leads to better Li kinetics, poor adsorption leads to Li clustering, significantly affecting the performance of the battery. Here, we show the role of defects and doping in achieving enhanced adsorption without compromising on the high diffusivity of Li. Using first principles density functional theory (DFT) calculations, we carry out a comprehensive study of diffusion kinetics of Li over the plane of the defective structures and calculate the change in the number of Li atoms in the vicinity of defects, with respect to pristine graphene. Our results show that the Li-C interaction, storage capacity and the energy barriers depend sensitively on the type of defects. The un-doped and boron doped mono-vacancy, doped di-vacancy up to two boron, one nitrogen doped di-vacancy, and Stone-Wales defects show low energy barriers that are comparable to pristine graphene. Furthermore, boron doping at mono-vacancy enhances the adsorption of Li. In particular, the two boron doped mono-vacancy graphene shows both a low energy barrier of 0.31 eV and better adsorption, and hence can be considered as a potential candidate for anode material.

Obtaining Synthon Modularity in Ternary Cocrystals with Hydrogen Bonds and Halogen Bonds

Design of ternary cocrystals based on synthon modularity is described. The strategy is based on the idea of extending synthon modularity in binary cocrystals of 4-hydroxybenzamide:dicarboxylic acids and 4-bromobenzamide:dicarboxylic acids. If a system contains an amide group along with other functional groups, one of which is a carboxylic acid group, the amide associates preferentially with the carboxylic acid group to form an acidamide heterosynthon. If the amide and the acid groups are in different molecules, a higher multicomponent molecular crystal is obtained. This is a stable pattern that can be used to increase the number of components from two to three in a multicomponent system. Accordingly, noncovalent interactions are controlled in the design of ternary cocrystals in a more predictable manner. If a single component crystal with the amideamide dimer is considered, modularity is retained even after formation of a binary cocrystal with acidamide dimers. Similarly, when third component halogen atom containing molecules are introduced into these binary cocrystals, modularity is still retained. Here, we use acidamide and Br/I center dot center dot center dot O2N supramolecular synthons to obtain modularity in nine ternary cocrystals. The acidamide heterosynthon is robust to all the nine cocrystals. Heterosynthons may assist ternary cocrystal formation when there is a high solubility difference between the coformers. For a successful crystal engineering strategy for ternary cocrystals, one must consider the synthon itself and factors like shape and size of the component molecules, as well as the solubilities of the compounds.

Regulation of Off-Network Pricing in a Nonneutral Network

Representatives of several Internet service providers (ISPs) have expressed their wish to see a substantial change in the pricing policies of the Internet. In particular, they would like to see content providers (CPs) pay for use of the network, given the large amount of resources they use. This would be in clear violation of the ``network neutrality'' principle that had characterized the development of the wireline Internet. Our first goal in this article is to propose and study possible ways of implementing such payments and of regulating their amount. We introduce a model that includes the users' behavior, the utilities of the ISP and of the CPs, and, the monetary flow that involves the content users, the ISP and CP, and, in pUrticular, the CP's revenues from advertisements. We consider various game models and study the resulting equilibria; they are all combinations of a noncooperative game (in which the ISPs and CPs determine how much they will charge the users) with a ``cooperative'' one on how the CP and the ISP share the payments. We include in our model a possible asymmetric weighting parameter (that varies between zero to one). We also study equilibria that arise when one of the CPs colludes with the TSP. We also study two dynamic game models as well as the convergence of prices to the equilibrium values.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Sphere to ring morphological transformation in drying nanofluid droplets in a contact-free environment

Understanding the transients of buckling in drying colloidal suspensions is pivotal for producing new functional microstructures with tunable morphologies. Here, we report first observations and elucidate the buckling instability induced morphological transition (sphere to ring structure) in an acoustically levitated, heated nanosuspension droplet using dynamic energy balance. Droplet deformation featuring the formation of symmetric cavities is initiated by capillary pressure that is two to three orders of magnitude greater than the acoustic radiation pressure, thus indicating that the standing pressure field has no influence on the buckling front kinetics. With an increase in heat flux, the growth rate of surface cavities and their post-buckled volume increase while the buckling time period reduces, thereby altering the buckling pathway and resulting in distinct precipitate structures. However, irrespective of the heating rate, the volumetric droplet deformation exhibits a linear time dependence and the droplet vaporization is observed to deviate from the classical D-2-law.

SEPARATION DIMENSION OF BOUNDED DEGREE GRAPHS

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in R-k such that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family F of total orders of the vertices of G such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on n vertices is Theta(log n). In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree d is at most 2(9) (log*d)d. We also demonstrate that the above bound is nearly tight by showing that, for every d, almost all d-regular graphs have separation dimension at least d/2]

Detection of a quantum particle on a lattice under repeated projective measurements

We consider a quantum particle, moving on a lattice with a tight-binding Hamiltonian, which is subjected to measurements to detect its arrival at a particular chosen set of sites. The projective measurements are made at regular time intervals tau, and we consider the evolution of the wave function until the time a detection occurs. We study the probabilities of its first detection at some time and, conversely, the probability of it not being detected (i.e., surviving) up to that time. We propose a general perturbative approach for understanding the dynamics which maps the evolution operator, which consists of unitary transformations followed by projections, to one described by a non-Hermitian Hamiltonian. For some examples of a particle moving on one-and two-dimensional lattices with one or more detection sites, we use this approach to find exact expressions for the survival probability and find excellent agreement with direct numerical results. A mean-field model with hopping between all pairs of sites and detection at one site is solved exactly. For the one-and two-dimensional systems, the survival probability is shown to have a power-law decay with time, where the power depends on the initial position of the particle. Finally, we show an interesting and nontrivial connection between the dynamics of the particle in our model and the evolution of a particle under a non-Hermitian Hamiltonian with a large absorbing potential at some sites.

Systematic status of Fejervarya ((Amphibia, Anura, Dicroglossidae) from South and SE Asia with the description of a new species from the Western Ghats of Peninsular India

We carried out a large-scale phylogenetic analysis of fejervaryan (dicroglossid frogs with `Fejervaryan lines' on the ventral side of the body) frogs, distributed in South and SE Asia, using published and newly generated sequences of unidentified individuals from the northern Western Ghats. The results corroborate the presence of a larger fejervaryan clade with a sister relationship to a clade composed of Sphaerotheca. Two sister clades could be discerned within the lager fejervaryan clade. The unidentified individuals formed a monophyletic group and showed a strong support for a sister relationship with Minervarya sahyadris. The species was found to be highly divergent (16S rRNA-4% and tyr-1%) from its sister lineage Minervarya sahyadris, and the clade composed of these two lineages were found to be deeply nested within the larger clade of Fejervarya. Based on this, the genus Minervarya Dubois, Ohler and Biju, 2001 is synonymized under the genus Fejervarya Bolkay, 1915. The unidentified lineage is recognized, based on phylogenetic position, genetic divergence and morphological divergence, as a distinct species and named here as Fejervarya gomantaki sp. nov. The presence of rictal glands was observed to be a synapomorphic character shared by the nested clade members, Fejervarya sahyadris and Fejervarya gomantaki sp. nov. Based on the presence of rictal gland and small size, Minervarya chilapata, a species from a lowland region in the Eastern Himalayas, is synonymized under Fejervarya and evidence for morphological separation from the new species, Fejervarya gomantaki sp. nov. is provided. For the fejervaryan frogs, currently three generic names (Frost, 2015) are available for the two phylogenetic subclades; the genus Fejervarya Bolkay, 1915 for the species of fejervaryan frogs having distribution in the South East Asia; the genus Zakerana Howlader, 2011 for the species of fejervaryan frogs having distribution in the South Asia and the genus Minervarya Dubois, Ohler and Biju, 2001 nested within the `Zakerana clade'. In the phylogenetic analysis Minervarya sahyadris, the new species described herein as Fejervarya gomantaki sp. nov. are nested within the `Zakerana clade', if the `Zakerana clade' for the fejervaryan frogs having distribution in the South Asia is provided a generic status the nomen `Minervarya' should be considered as per the principle of priority of the ICZN Code. Taking into consideration the overlapping distribution ranges of members of the sister clades within the larger fejervaryan clade and the absence of distinct morphological characteristics, we also synonymize the genus Zakerana Howlader, 2011, a name assigned to one of the sister clades with members predominantly distributed in South Asia, under the genus Fejervarya Bolkay, 1915. We discuss the need for additional sampling to identify additional taxa and determine the geographical ranges of the members of the sister clades within Fejervarya to resolve taxonomy within this group.