999 resultados para Cyclic generalized polynomial codes
Resumo:
1919/11 (T12,A26,N11)-1919/12 (T12,A26,N12).
Resumo:
Variante(s) de titre : Même texte que : "Revue des lois. Bulletin pratique mensuel". - A partir de 1894 une 2e partie paraît indépendamment sous le titre de : "Bulletin-commentaire des lois nouvelles et décrets", voir ce titre
The role of cyclic nucleotides in modulation of crayfish neuromuscular junctions by a neuropeptide /
Resumo:
DF2, a heptapeptide, is a member of the family of FMRFamide-like peptides and has been shown to increase the amount of transmitter released at neuromuscular junctions of the crayfish, Procambarus clarkit Recent evidence has shown that protein kinase C (PKC), calcium/calmodulin-dependent protein kinase II (CaMKII) and the cAMPdependent protein kinase (PKA) play a role in the neuromodulatory pathway of DF2. The involvement of these kinases led to the prediction that a G-protein-coupled receptor (GPCR) is activated by DF2 due to the role that each kinase plays in traditional GPCR pathways seen in other organisms and in other cells. G-proteins can also act on an enzyme that generates cyclic guanosine monophosphate (cGMP) which mediates its effects through a cGMP-dependent protein kinase (PKG). This thesis addresses the question of whether or not DF2's effects on synaptic transmission in crayfish are mediated by the cyclic nucleotides cAMP and cGMP. The effects of DF2 on synaptic transmission were examined using deep abdominal extensor muscles of the crayfish Procambarus clarkii. An identified motor neuron was stimulated, and excitatory post-synaptic potentials (EPSPs) were recorded in abdominal extensor muscle LI . A number of activators and inhibitors were used to determine whether or not cAMP, PKA, cGMP and PKG mediate the effect of this peptide. Chemicals that are known to activate PKA (Sp-cAMPS) and/or PKG (8-pCPTcGMP) mimic and potentiate DF2's effect by increasing EPSP amplitude. Inhibitors of either PKA (Rp-cAMPS) or PKG (Rp-8-pCPT-cGMPS) block a portion of the increase in EPSP amplitude induced by the peptide. When both kinase inhibitors are applied simultaneously, the entire effect of DF2 on EPSPs is blocked. The PKG inhibitor blocks the effects of a PKG activator but does not alter the effect of a PKA activator on EPSP amplitude. Thus, the PKG inhibitor appears to be relatively specific for PKG. A trend in the data suggests that the PKA inhibitor blocks a portion of the response elicited by the PKG activator. Thus, the PKA inhibitor may be less specific for PKA. Phosphodiesterase inhibitors, which are known to inhibit the breakdown of cAMP (IBMX) and/or cGMP (mdBAMQ), potentiate the effect of the peptide. These results support the hypothesis that cAMP and cGMP, acting through their respective protein kinase enzymes, mediate the ability of DFi to increase transmitter output.
Resumo:
The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an integer. This thesis investigates two major problems, the first of which is referred to as the basic pair problem. This problem seeks to determine conditions for which every zero-sequence of a given length in a finite abelian group has the basic property. We resolve an open problem regarding basic pairs in cyclic groups by demonstrating that every sequence of length four in Zp has the basic property, and we conjecture on the complete solution of this problem. The second problem is a 1988 conjecture of Kleitman and Lemke, part of which claims that every sequence of length n in Zn has a subsequence with the basic property. If one considers the special case where n is an odd integer we believe this conjecture to hold true. We verify this is the case for all prime integers less than 40, and all odd integers less than 26. In addition, we resolve the Kleitman-Lemke conjecture for general n in the negative. That is, we demonstrate a sequence in any finite abelian group isomorphic to Z2p (for p ~ 11 a prime) containing no subsequence with the basic property. These results, as well as the results found along the way, contribute to many other problems in zero-sum theory.
Resumo:
The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.