961 resultados para Boolean Functions, Equivalence Class
Resumo:
Social insects provide an excellent platform to investigate flow of information in regulatory systems since their successful social organization is essentially achieved by effective information transfer through complex connectivity patterns among the colony members. Network representation of such behavioural interactions offers a powerful tool for structural as well as dynamical analysis of the underlying regulatory systems. In this paper, we focus on the dominance interaction networks in the tropical social wasp Ropalidia marginata-a species where behavioural observations indicate that such interactions are principally responsible for the transfer of information between individuals about their colony needs, resulting in a regulation of their own activities. Our research reveals that the dominance networks of R. marginata are structurally similar to a class of naturally evolved information processing networks, a fact confirmed also by the predominance of a specific substructure-the `feed-forward loop'-a key functional component in many other information transfer networks. The dynamical analysis through Boolean modelling confirms that the networks are sufficiently stable under small fluctuations and yet capable of more efficient information transfer compared to their randomized counterparts. Our results suggest the involvement of a common structural design principle in different biological regulatory systems and a possible similarity with respect to the effect of selection on the organization levels of such systems. The findings are also consistent with the hypothesis that dominance behaviour has been shaped by natural selection to co-opt the information transfer process in such social insect species, in addition to its primal function of mediation of reproductive competition in the colony.
Resumo:
Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
For a domain Omega in C and an operator T in B-n(Omega), Cowen and Douglas construct a Hermitian holomorphic vector bundle E-T over Omega corresponding to T. The Hermitian holomorphic vector bundle E-T is obtained as a pull-back of the tautological bundle S(n, H) defined over by Gr(n, H) a nondegenerate holomorphic map z bar right arrow ker(T - z), z is an element of Omega. To find the answer to the converse, Cowen and Douglas studied the jet bundle in their foundational paper. The computations in this paper for the curvature of the jet bundle are rather intricate. They have given a set of invariants to determine if two rank n Hermitian holomorphic vector bundle are equivalent. These invariants are complicated and not easy to compute. It is natural to expect that the equivalence of Hermitian holomorphic jet bundles should be easier to characterize. In fact, in the case of the Hermitian holomorphic jet bundle J(k)(L-f), we have shown that the curvature of the line bundle L-f completely determines the class of J(k)(L-f). In case of rank Hermitian holomorphic vector bundle E-f, We have calculated the curvature of jet bundle J(k)(E-f) and also obtained a trace formula for jet bundle J(k)(E-f).
Resumo:
In this paper, we study the inverse mode shape problem for an Euler-Bernoulli beam, using an analytical approach. The mass and stiffness variations are determined for a beam, having various boundary conditions, which has a prescribed polynomial second mode shape with an internal node. It is found that physically feasible rectangular cross-section beams which satisfy the inverse problem exist for a variety of boundary conditions. The effect of the location of the internal node on the mass and stiffness variations and on the deflection of the beam is studied. The derived functions are used to verify the p-version finite element code, for the cantilever boundary condition. The paper also presents the bounds on the location of the internal node, for a valid mass and stiffness variation, for any given boundary condition. The derived property variations, corresponding to a given mode shape and boundary condition, also provides a simple closed-form solution for a class of non-uniform Euler-Bernoulli beams. These closed-form solutions can also be used to check optimization algorithms proposed for modal tailoring.
Resumo:
Using the attractor mechanism for extremal solutions in N = 2 gauged supergravity, we construct a c-function that interpolates between the central charges of theories at ultraviolet and infrared conformal fixed points corresponding to anti-de Sitter geometries. The c-function we obtain is couched purely in terms of bulk quantities and connects two different dimensional CFTs at the stable conformal fixed points under the RG flow.
Resumo:
We present in this paper a new algorithm based on Particle Swarm Optimization (PSO) for solving Dynamic Single Objective Constrained Optimization (DCOP) problems. We have modified several different parameters of the original particle swarm optimization algorithm by introducing new types of particles for local search and to detect changes in the search space. The algorithm is tested with a known benchmark set and compare with the results with other contemporary works. We demonstrate the convergence properties by using convergence graphs and also the illustrate the changes in the current benchmark problems for more realistic correspondence to practical real world problems.
Resumo:
We address the problem of two-dimensional (2-D) phase retrieval from magnitude of the Fourier spectrum. We consider 2-D signals that are characterized by first-order difference equations, which have a parametric representation in the Fourier domain. We show that, under appropriate stability conditions, such signals can be reconstructed uniquely from the Fourier transform magnitude. We formulate the phase retrieval problem as one of computing the parameters that uniquely determine the signal. We show that the problem can be solved by employing the annihilating filter method, particularly for the case when the parameters are distinct. For the more general case of the repeating parameters, the annihilating filter method is not applicable. We circumvent the problem by employing the algebraically coupled matrix pencil (ACMP) method. In the noiseless measurement setup, exact phase retrieval is possible. We also establish a link between the proposed analysis and 2-D cepstrum. In the noisy case, we derive Cramer-Rao lower bounds (CRLBs) on the estimates of the parameters and present Monte Carlo performance analysis as a function of the noise level. Comparisons with state-of-the-art techniques in terms of signal reconstruction accuracy show that the proposed technique outperforms the Fienup and relaxed averaged alternating reflections (RAAR) algorithms in the presence of noise.
Resumo:
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.
Resumo:
Itaconic acid is a bio-sourced dicarboxylic acid that carries a double bond; although several reports have dealt with the radical-initiated chain polymerization of dialkyl itaconates, only a few studies have utilized it as a di-acid monomer to prepare polyesters. In this study, we demonstrate that dibutyl itaconate can be melt-condensed with aliphatic diols to generate unsaturated polyesters; importantly, we show that the double bonds remain unaffected during the melt polymerization. A particularly useful attribute of these polyesters is that the exo-chain double bonds are conjugated to the ester carbonyl and, therefore, can serve as excellent Michael acceptors. A variety of organic thiols, such as alkane thiols, MPEG thiol, thioglycerol, derivatized cysteine etc., were shown to quantitatively Michael-add to the exo-chain double bonds and generate interesting functionalized polyesters. Similarly, organic amines, such as N-methyl-benzylamine, diallyl amine and proline, also add across the double bond; thus, these poly(alkylene itaconate)s could serve as potentially bio-benign polyesters that could be quantitatively transformed into a variety of interesting and potentially useful functionalized polymers.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
A convenient and efficient one-pot synthesis of benzofurans 3a, 3b, 3c, 3d, 3e, 3f, 3g, 3h, 3i, 3j, 3k, 3l, 3m, 3n, 3o, 3p, 3q, 3r, 3s, 3t has been described from 2-hydroxy acetophenones and phenacyl chlorides in the presence of DBU. The procedure was applicable for a variety of phenacyl chlorides and provides a variety of benzofurans with higher yields. DBU acts as a base and as well as nucleophiles. All the derivatives were subjected to in vitro antioxidant screenings against representative 2,2-diphenyl-1-picryl-hydrazyl and 2,2-azino-bis(3-ethylbenzthiazoline-6-sulfonic acid) radicals and results worth for further investigations.
Resumo:
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.
Resumo:
Retransmission protocols such as HDLC and TCP are designed to ensure reliable communication over noisy channels (i.e., channels that can corrupt messages). Thakkar et al. 15] have recently presented an algorithmic verification technique for deterministic streaming string transducer (DSST) models of such protocols. The verification problem is posed as equivalence checking between the specification and protocol DSSTs. In this paper, we argue that more general models need to be obtained using non-deterministic streaming string transducers (NSSTs). However, equivalence checking is undecidable for NSSTs. We present two classes where the models belong to a sub-class of NSSTs for which it is decidable. (C) 2015 Elsevier B.V. All rights reserved.