An Algorithmic Characterization of Polynomial Functions over Z(pn)

In this paper we consider polynomial representability of functions defined over , where p is a prime and n is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to determine whether a given function over is polynomially representable or not, and (ii) finds the polynomial if it is polynomially representable. The previous characterizations given by Kempner (Trans. Am. Math. Soc. 22(2):240-266, 1921) and Carlitz (Acta Arith. 9(1), 67-78, 1964) are existential in nature and only lead to an exhaustive search method, i.e. algorithm with complexity exponential in size of the input. Our characterization leads to an algorithm whose running time is linear in size of input. We also extend our result to the multivariate case.

Lower bounds for testing triangle-freeness in Boolean functions

Given a Boolean function , we say a triple (x, y, x + y) is a triangle in f if . A triangle-free function contains no triangle. If f differs from every triangle-free function on at least points, then f is said to be -far from triangle-free. In this work, we analyze the query complexity of testers that, with constant probability, distinguish triangle-free functions from those -far from triangle-free. Let the canonical tester for triangle-freeness denotes the algorithm that repeatedly picks x and y uniformly and independently at random from , queries f(x), f(y) and f(x + y), and checks whether f(x) = f(y) = f(x + y) = 1. Green showed that the canonical tester rejects functions -far from triangle-free with constant probability if its query complexity is a tower of 2's whose height is polynomial in . Fox later improved the height of the tower in Green's upper bound to . A trivial lower bound of on the query complexity is immediate. In this paper, we give the first non-trivial lower bound for the number of queries needed. We show that, for every small enough , there exists an integer such that for all there exists a function depending on all n variables which is -far from being triangle-free and requires queries for the canonical tester. We also show that the query complexity of any general (possibly adaptive) one-sided tester for triangle-freeness is at least square root of the query complexity of the corresponding canonical tester. Consequently, this means that any one-sided tester for triangle-freeness must make at least queries.

Typical and atypical domain combinations in human protein kinases: functions, disease causing mutations and conservation in other primates

Ser/Thr and Tyr protein kinases orchestrate many signalling pathways and hence loss in this balance leads to many disease phenotypes. Due to their high abundance, diversity and importance, efforts have been made in the past to classify kinases and annotate their functions at both gross and fine levels. These kinases are conventionally classified into subfamilies based on the sequences of catalytic domains. Usually the domain architecture of a full-length kinase is consistent with the subfamily classification made based on the sequence of kinase domain. Important contributions of modular domains to the overall function of the kinase are well known. Recently occurrence of two kinds of outlier kinases-''Hybrid'' and ``Rogue'' has been reported. These show considerable deviations in their domain architectures from the typical domain architecture known for the classical kinase subfamilies. This article provides an overview of the different subfamilies of human kinases and the role of non-kinase domains in functions and diseases. Importantly this article provides analysis of hybrid and rogue kinases encoded in the human genome and highlights their conservation in closely related primate species. These kinases are examples of elegant rewiring to bring about subtle functional differences compared to canonical variants.

Novel Functions of (p)ppGpp and Cyclic di-GMP in Mycobacterial Physiology Revealed by Phenotype Microarray Analysis of Wild-Type and Isogenic Strains of Mycobacterium smegmatis

The bacterial second messengers (p)ppGpp and bis-(3'-5')-cyclic dimeric GMP (c-di-GMP) regulate important functions, such as transcription, virulence, biofilm formation, and quorum sensing. In mycobacteria, they regulate long-term survival during starvation, pathogenicity, and dormancy. Recently, a Pseudomonas aeruginosa strain lacking (p) ppGpp was shown to be sensitive to multiple classes of antibiotics and defective in biofilm formation. We were interested to find out whether Mycobacterium smegmatis strains lacking the gene for either (p)ppGpp synthesis (Delta rel(Msm)) or c-di-GMP synthesis (Delta dcpA) would display similar phenotypes. We used phenotype microarray technology to compare the growth of the wild-type and the knockout strains in the presence of several antibiotics. Surprisingly, the Delta rel(Msm) and Delta dcpA strains showed enhanced survival in the presence of many antibiotics, but they were defective in biofilm formation. These strains also displayed altered surface properties, like impaired sliding motility, rough colony morphology, and increased aggregation in liquid cultures. Biofilm formation and surface properties are associated with the presence of glycopeptidolipids (GPLs) in the cell walls of M. smegmatis. Thin-layer chromatography analysis of various cell wall fractions revealed that the levels of GPLs and polar lipids were reduced in the knockout strains. As a result, the cell walls of the knockout strains were significantly more hydrophobic than those of the wild type and the complemented strains. We hypothesize that reduced levels of GPLs and polar lipids may contribute to the antibiotic resistance shown by the knockout strains. Altogether, our data suggest that (p)ppGpp and c-di-GMP may be involved in the metabolism of glycopeptidolipids and polar lipids in M. smegmatis.

Tailoring the dispersion of multiwall carbon nanotubes in co-continuous PVDF/ABS blends to design materials with enhanced electromagnetic interference shielding

Highly conducting composites were derived by selectively localizing multiwall carbon nanotubes (MWNTs) in co-continuous PVDF/ABS (50/50, wt/wt) blends. The electrical percolation threshold was obtained between 0.5 and 1 wt% MWNTs as manifested by a dramatic increase in the electrical conductivity by about six orders of magnitude with respect to the neat blends. In order to further enhance the electrical conductivity of the blends, the MWNTs were modified with amine terminated ionic liquid (IL), which, besides enhancing the interfacial interaction with PVDF, facilitated the formation of a network like structure of MWNTs. This high electrical conductivity of the blends, at a relatively low fraction (1 wt%), was further explored to design materials that can attenuate electromagnetic (EM) radiation. More specifically, to attenuate the EM radiation by absorption, a ferroelectric phase was introduced. To accomplish this, barium titanate (BT) nanoparticles chemically stitched onto graphene oxide (GO) sheets were synthesized and mixed along with MWNTs in the blends. Intriguingly, the total EM shielding effectiveness (SE) was enhanced by ca. 10 dB with respect to the blends with only MWNTs. In addition, the effect of introducing a ferromagnetic phase (Fe3O4) along with IL modified MWNTs was also investigated. This study opens new avenues in designing materials that can attenuate EM radiation by selecting either a ferroelectric (BT-GO) or a ferromagnetic phase (Fe3O4) along with intrinsically conducting nanoparticles (MWNTs).

A faster algorithm for testing polynomial representability of functions over finite integer rings

Given a function from Z(n) to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over Z(n) by constructing a generating set for the Z(n)-module of polynomial functions. This characterization results in an algorithm that is faster on average in deciding polynomial representability. We also extend the characterization to functions in several variables. (C) 2015 Elsevier B.V. All rights reserved.

Continuous vapour adsorption cooling system with three adsorber beds

In this paper, the design of a new solar operated adsorption cooling system with two identical small and one large adsorber beds, which is capable of producing cold continuously, has been proposed. In this system, cold energy is stored in the form of refrigerant in a separate refrigerant storage tank at ambient temperature. Silica gel water is used as a working pair and system is driven by solar energy. The operating principle is described in details and its thermodynamic transient analysis is presented. Effect of COP and SCE for different adsorbent mass and adsorption/desorption time of smaller beds are discussed. Recommended mass and number of cycles of operation for smaller beds to attain continuous cooling with average COP and SCE of 0.63 and 337.5 kJ/kg, respectively are also discussed, at a generation, condenser and evaporator temperatures of 368 K, 303 K and 283 K, respectively. (C) 2015 Elsevier Ltd. All rights reserved.

Functions for rice RFL in vegetative axillary meristem specification and outgrowth

Roles for the transcription factor RFL in rice axillary meristem development were studied. Its regulatory effects on LAX1, CUC1, and OsPIN3 reveal its functions in axillary meristem specification and outgrowth.Axillary meristems (AMs) are secondary shoot meristems whose outgrowth determines plant architecture. In rice, AMs form tillers, and tillering mutants reveal an interplay between transcription factors and the phytohormones auxin and strigolactone as some factors that underpin this developmental process. Previous studies showed that knockdown of the transcription factor gene RFL reduced tillering and caused a very large decrease in panicle branching. Here, the relationship between RFL, AM initiation, and outgrowth was examined. We show that RFL promotes AM specification through its effects on LAX1 and CUC genes, as their expression was modulated on RFL knockdown, on induction of RFL:GR fusion protein, and by a repressive RFL-EAR fusion protein. Further, we report reduced expression of auxin transporter genes OsPIN1 and OsPIN3 in the culm of RFL knockdown transgenic plants. Additionally, subtle change in the spatial pattern of IR4 DR5:GFP auxin reporter was observed, which hints at compromised auxin transport on RFL knockdown. The relationship between RFL, strigolactone signalling, and bud outgrowth was studied by transcript analyses and by the tillering phenotype of transgenic plants knocked down for both RFL and D3. These data suggest indirect RFL-strigolactone links that may affect tillering. Further, we show expression modulation of the auxin transporter gene OsPIN3 upon RFL:GR protein induction and by the repressive RFL-EAR protein. These modified forms of RFL had only indirect effects on OsPIN1. Together, we have found that RFL regulates the LAX1 and CUC genes during AM specification, and positively influences the outgrowth of AMs though its effects on auxin transport.

Splicing Functions and Global Dependency on Fission Yeast Slu7 Reveal Diversity in Spliceosome Assembly

The multiple short introns in Schizosaccharomyces pombe genes with degenerate cis sequences and atypically positioned polypyrimidine tracts make an interesting model to investigate canonical and alternative roles for conserved splicing factors. Here we report functions and interactions of the S. pombe slu7(+) (spslu7(+)) gene product, known from Saccharomyces cerevisiae and human in vitro reactions to assemble into spliceosomes after the first catalytic reaction and to dictate 3' splice site choice during the second reaction. By using a missense mutant of this essential S. pombe factor, we detected a range of global splicing derangements that were validated in assays for the splicing status of diverse candidate introns. We ascribe widespread, intron-specific SpSlu7 functions and have deduced several features, including the branch nucleotide-to-3' splice site distance, intron length, and the impact of its A/U content at the 5' end on the intron's dependence on SpSlu7. The data imply dynamic substrate-splicing factor relationships in multiintron transcripts. Interestingly, the unexpected early splicing arrest in spslu7-2 revealed a role before catalysis. We detected a salt-stable association with U5 snRNP and observed genetic interactions with spprp1(+), a homolog of human U5-102k factor. These observations together point to an altered recruitment and dependence on SpSlu7, suggesting its role in facilitating transitions that promote catalysis, and highlight the diversity in spliceosome assembly.

Continuous synthesis of high quality CdSe quantum dots in supercritical fluids

We demonstrate in here a powerful scalable technology to synthesize continuously high quality CdSe quantum dots (QDs) in supercritical hexane. Using a low cost, highly thermally stable Cd-precursor, cadmium deoxycholate, the continuous synthesis is performed in 400 mu m ID stainless steel capillaries resulting in CdSe QDs having sharp full-width-at-half-maxima (23 nm) and high photoluminescence quantum yields (45-55%). Transmission electron microscopy images show narrow particles sizes distribution (sigma <= 5%) with well-defined crystal lattices. Using two different synthesis temperatures (250 degrees C and 310 degrees C), it was possible to obtain zinc blende and wurtzite crystal structures of CdSe QDs, respectively. This synthetic approach allows achieving substantial production rates up to 200 mg of QDs per hour depending on the targeted size, and could be easily scaled to gram per hour.

Risk-Sensitive Ergodic Control of Continuous Time Markov Processes With Denumerable State Space

In this article, we study risk-sensitive control problem with controlled continuous time Markov chain state dynamics. Using multiplicative dynamic programming principle along with the atomic structure of the state dynamics, we prove the existence and a characterization of optimal risk-sensitive control under geometric ergodicity of the state dynamics along with a smallness condition on the running cost.

A Perspective to Adopt Continuous Dynamic Cognition for Malicious Node Detection in Heterogeneous Networks

The current day networks use Proactive networks for adaption to the dynamic scenarios. The use of cognition technique based on the Observe, Orient, Decide and Act loop (OODA) is proposed to construct proactive networks. The network performance degradation in knowledge acquisition and malicious node presence is a problem that exists. The use of continuous time dynamic neural network is considered to achieve cognition. The variance in service rates of user nodes is used to detect malicious activity in heterogeneous networks. The improved malicious node detection rates are proved through the experimental results presented in this paper. (C) 2015 The Authors. Published by Elsevier B.V.

PLAStiCC: Predictive Look-Ahead Scheduling for Continuous dataflows on Clouds

Scalable stream processing and continuous dataflow systems are gaining traction with the rise of big data due to the need for processing high velocity data in near real time. Unlike batch processing systems such as MapReduce and workflows, static scheduling strategies fall short for continuous dataflows due to the variations in the input data rates and the need for sustained throughput. The elastic resource provisioning of cloud infrastructure is valuable to meet the changing resource needs of such continuous applications. However, multi-tenant cloud resources introduce yet another dimension of performance variability that impacts the application's throughput. In this paper we propose PLAStiCC, an adaptive scheduling algorithm that balances resource cost and application throughput using a prediction-based lookahead approach. It not only addresses variations in the input data rates but also the underlying cloud infrastructure. In addition, we also propose several simpler static scheduling heuristics that operate in the absence of accurate performance prediction model. These static and adaptive heuristics are evaluated through extensive simulations using performance traces obtained from Amazon AWS IaaS public cloud. Our results show an improvement of up to 20% in the overall profit as compared to the reactive adaptation algorithm.

Simultaneous nonvanishing of Dirichlet L-functions and twists of Hecke-Maass L-functions

We prove that given a Hecke-Maass form f for SL(2, Z) and a sufficiently large prime q, there exists a primitive Dirichlet character chi of conductor q such that the L-values L(1/2, f circle times chi) and L(1/2, chi) do not vanish.