131 resultados para Permutations
Resumo:
Neste trabalho discutimos vários sistemas de dígitos verificadores utilizados no Brasil, muitos deles semelhantes a esquemas usados mundialmente, e fazemos uma análise da sua capacidade de detectar os diversos tipos de erros que são comuns na entrada de dados em sistemas computacionais. A análise nos mostra que os esquemas escolhidos constituem decisões subotimizadas e quase nunca obtêm a melhor taxa de detecção de erros possível. Os sistemas de dígitos verificadores são baseados em três teorias da álgebra: aritmética modular, teoria de grupos e quasigrupos. Para os sistemas baseados em aritmética modular, apresentamos várias melhorias que podem ser introduzidas. Desenvolvemos um novo esquema ótimo baseado em aritmética modular base 10 com três permutações para identificadores de tamanho maior do que sete. Descrevemos também o esquema Verhoeff, já antigo, mas pouquíssimo utilizado e que também é uma alternativa de melhoria para identificadores de tamanho até sete. Desenvolvemos ainda, esquemas ótimos para qualquer base modular prima que detectam todos os tipos de erros considerados. A dissertação faz uso ainda de elementos da estatística, no estudo das probabilidades de detecção de erros e de algoritmos, na obtenção de esquemas ótimos.
Resumo:
Protein tyrosine phosphatases (PTPs) are comprised of two superfamilies, the phosphatase I superfamily containing a single low-molecular-weight PTP (lmwPTP) family and the phosphatase II superfamily including both the higher-molecular-weight PTP (hmwPTP) and the dual-specificity phosphatase (DSP) families. The phosphatase I and H superfamilies are often considered to be the result of convergent evolution. The PTP sequence and structure analyses indicate that lmwPTPs, hmwPTPs, and DSPs share similar structures, functions, and a common signature motif, although they have low sequence identities and a different order of active sites in sequence or a circular permutation. The results of this work suggest that lmwPTPs and hmwPTPs/DSPs are remotely related in evolution. The earliest ancestral gene of PTPs could be from a short fragment containing about 90similar to120 nucleotides or 30similar to40 residues; however, a probable full PTP ancestral gene contained one transcript unit with two lmwPTP genes. All three PTP families may have resulted from a common ancestral gene by a series of duplications, fusions, and circular permutations. The circular permutation in PTPs is caused by a reading frame difference, which is similar to that in DNA methyltransferases. Nevertheless, the evolutionary mechanism of circular permutation in PTP genes seems to be more complicated than that in DNA methyltransferase genes. Both mechanisms in PTPs and DNA methyltransferases can be used to explain how some protein families and superfamilies came to be formed by circular permutations during molecular evolution.
Resumo:
We consider the general problem of constructing nonparametric Bayesian models on infinite-dimensional random objects, such as functions, infinite graphs or infinite permutations. The problem has generated much interest in machine learning, where it is treated heuristically, but has not been studied in full generality in non-parametric Bayesian statistics, which tends to focus on models over probability distributions. Our approach applies a standard tool of stochastic process theory, the construction of stochastic processes from their finite-dimensional marginal distributions. The main contribution of the paper is a generalization of the classic Kolmogorov extension theorem to conditional probabilities. This extension allows a rigorous construction of nonparametric Bayesian models from systems of finite-dimensional, parametric Bayes equations. Using this approach, we show (i) how existence of a conjugate posterior for the nonparametric model can be guaranteed by choosing conjugate finite-dimensional models in the construction, (ii) how the mapping to the posterior parameters of the nonparametric model can be explicitly determined, and (iii) that the construction of conjugate models in essence requires the finite-dimensional models to be in the exponential family. As an application of our constructive framework, we derive a model on infinite permutations, the nonparametric Bayesian analogue of a model recently proposed for the analysis of rank data.
Resumo:
Simulation of materials at the atomistic level is an important tool in studying microscopic structure and processes. The atomic interactions necessary for the simulation are correctly described by Quantum Mechanics. However, the computational resources required to solve the quantum mechanical equations limits the use of Quantum Mechanics at most to a few hundreds of atoms and only to a small fraction of the available configurational space. This thesis presents the results of my research on the development of a new interatomic potential generation scheme, which we refer to as Gaussian Approximation Potentials. In our framework, the quantum mechanical potential energy surface is interpolated between a set of predetermined values at different points in atomic configurational space by a non-linear, non-parametric regression method, the Gaussian Process. To perform the fitting, we represent the atomic environments by the bispectrum, which is invariant to permutations of the atoms in the neighbourhood and to global rotations. The result is a general scheme, that allows one to generate interatomic potentials based on arbitrary quantum mechanical data. We built a series of Gaussian Approximation Potentials using data obtained from Density Functional Theory and tested the capabilities of the method. We showed that our models reproduce the quantum mechanical potential energy surface remarkably well for the group IV semiconductors, iron and gallium nitride. Our potentials, while maintaining quantum mechanical accuracy, are several orders of magnitude faster than Quantum Mechanical methods.
Resumo:
在随机Oracle模型的基础上, 提出一种基于单向陷门置换(trapdoor permutations, TDPs)的、可并行的、长消息签密方案——PLSC (parallel long-message signcryption). 该方法采用“整体搅乱, 局部加密(scramble all, and encrypt small)”的思想, 用一个伪随机数对要传送的消息和用户的身份(ID)进行“搅乱(scrambling operation)”, 然后对两个固定长度的小片段(并行地)进行单向陷门置换(TDP)操作. 这种设计使得整个方案可直接高效地处理任意长度的消息, 既可避免循环调用单向陷门置换(如CBC模式)所造成的计算资源的极度消耗, 也可避免由“对称加密方案”与“签密方案”进行“黑盒混合(black-box hybrid)”所造成的填充(padding)冗余. 不仅可以显著地节约消息带宽, 而且可以显著地提高整体效率. 具体地说, 该方法对任何长度的消息进行签密, 仅需进行一次接收方的TDP运算(相当于加密), 以及一次发送方的TDP运算(相当于签名), 从而最大限度地降低了TDP运算的次数, 提高了整体的运算效率. 因为, 对于公钥加密算法来说, 运算量主要集中在TDP运算上, TDP运算是整个算法的瓶颈所在. 另一方面, 由于避免了填充上的冗余, 新方案的效率也高于标准的“黑盒混合”方案.重要的是, 新方案能够达到选择密文攻击下的紧致的语义安全性(IND- CCA2)、密文完整性(INT-CTXT)以及不可否认性(non-repudiation). 而且所有这些安全要求都可以在多用户(multi-user)、内部安全(insider-security)的环境下得以实现. 另外, 尽管新方案主要针对长消息的签密, 但它也可应用于某些不能进行大块数据处理的环境(智能卡或其他只有少量内存的环境). 也就是说, 对于这些小内存设备来说, 仍然可以用该方案来实现长消息的签密处理.
Resumo:
The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied - these models are exactly the Cartesian closed categories. Isomorphism of two simple types in such a model is decidable by reduction to a normal form and comparison under a finite number of permutations (Bruce, Di Cosmo, and Longo 1992). Unfortunately, these normal forms may be exponentially larger than the original types so this construction decides isomorphism in exponential time. We show how using space-sharing/hash-consing techniques and memoization can be used to decide isomorphism in practical polynomial time (low degree, small hidden constant). Other researchers have investigated simple type isomorphism in relation to, among other potential applications, type-based retrieval of software modules from libraries and automatic generation of bridge code for multi-language systems. Our result makes such potential applications practically feasible.
Resumo:
The Law operates by, and through, the creation of ideal benchmarks of conduct that are deemed to be representative of the behavioural norm. It is in this sense that it could be contended that the Law utilises, and relies on, myths in the same way as do other disciplines, notably psycho-analysis. It is possible to go even further and argue that the use of a created narrative mythology is essential to the establishment of a defined legal benchmark of behaviour by which the female defendant is assessed, judged and punished. While mythology expresses and symbolizes cultural and political behaviour, it is the Law that embodies and prescribes punitive sanctions. This element represents a powerful literary strand in classical mythology. This may be seen, for instance, in Antigone’s appeal to the Law as justification for her conduct, as much as in Medea’s challenge to the Law though her desire for vengeance. Despite its image of neutral, objective rationality, the Law, in creating and sustaining the ideals of legally-sanctioned conduct, engages in the same literary processes of imagination, reason and emotion that are central to the creation and re-creation of myth. The (re-)presentation of the Medea myth in literature (especially in theatre) and in art, finds its echo in the theatre of the courtroom where wronged women who have refused to passively accept their place, have instead responded with violence. Consequently, the Medea myth, in its depiction of the (un)feminine, serves as a template for the Law’s judgment of ‘conventional’ feminine conduct in the roles of wife and mother. Medea is an image of deviant femininity, as is Lady Macbeth and the countless other un-feminine literary and mythological women who challenge the power of the dominant culture and its ally, the Law. These women stand opposed to the other dominant theme of both literature and Law: the conformist woman, the passive dupe, who are victims of male oppression – women such as Ariadne of Naxos and Tess of the D’Ubervilles – and who are subsequently consumed by the Law, much as Semele is consumed by the fire of Jupiter’s gaze upon her. All of these women, the former as well as the latter, have their real-life counterparts in the pages of the Law Reports. As Fox puts it, “these women have come to bear the weight of the cultural stereotypes and preconceptions about women who kill.”
Resumo:
A flexible panel consisting of 38 informative microsatellite markers for Salmo trutta is described. These markers were selected from a pool of over 150 candidate loci that can be readily amplified in four multiplex PCR groups but other permutations are also possible. The basic properties of each markers were assessed in six population samples from both the Burrishoole catchment, in the west of Ireland, and Lough Neagh, in Northern Ireland. A method to assess the relative utility of individual markers for the detection of population genetic structuring is also described. Given its flexibility, technical reliability and high degree of informativeness, the use of this panel of markers is advocated as a standard for S. trutta genetic studies. © 2013 The Authors. Journal of Fish Biology © 2013 The Fisheries Society of the British Isles.
Resumo:
Esta tese dedica-se ao estudo de hipermapas regulares bicontactuais, hipermapas com a propriedade que cada hiperface contacta só com outras duas hiperfaces. Nos anos 70, S. Wilson classificou os mapas bicontactuais e, em 2003, Wilson e Breda d’Azevedo classificaram os hipermapas bicontactuais no caso não-orientável. Quando esta propriedade é transferida para hipermapas origina três tipos de bicontactualidade, atendendo ao modo como as duas hiperfaces aparecem à volta de uma hiperface fixa: edge-twin, vertextwin and alternate (dois deles são o dual um do outro). Um hipermapa topológico é um mergulho celular de um grafo conexo trivalente numa superfície compacta e conexa tal que as células são 3-coloridas. Ou de maneira mais simples, um hipermapa pode ser visto como um mapa bipartido. Um hipermapa orientado regular é um triplo ordenado consistindo num conjunto finito e dois geradores, que são permutações (involuções) do conjunto tal que o grupo gerado por eles, chamado o grupo de monodromia, actua regularmente no conjunto. Nesta tese, damos uma classificação de todos os hipermapas orientados regulares bicontactuais e, para completar, reclassificamos, usando o nosso método algébrico, os hipermapas não-orientáveis bicontactuais.
Resumo:
Proceedings of the 10th Conference on Dynamical Systems Theory and Applications
Resumo:
Growth rates of etiolated Avena sativa coleoptiles in pH 7.0 buffered medium are stimulated in a synergistic manner by IAA and 320 ~l/l carbon dioxide. The suggestion that carbon dioxide stimulated growth involves dark fixation is supported by the ability of 1 mM malate to replace carbon dioxide, with neither factor able to stimulate growth in the presence of the other (Bown, Dymock and Aung, 1974). The regulation of Avena coleoptile growth by ethylene has been investigated in the light of this data and the well documented antagonism between carbon dioxide and ethylene in the regulation of developmental processes. The influence of various permutations of ethylene, IAA, carbon dioxide and malate on the rates of growth, l4c-bicarbonate incorporation, l4C-bicarbonate fixation, and malate decarboxylation have been investigated. In the presence of 320 ~l/l carbon dioxide, 10.8 ~l/l ethylene inhibited growth both in the absence and presence of 20 ~M IAA with inhibition times, of 8-10 and 12-13 minutes respectively. In contrast ethylene inhibition of growth was not significant in the absence of growth stimulation by CO2 or 1 mM malate, and the normal growth increases in response to CO2 and malate were blocked by the simultaneous application of ethylene. The rates of incorporation and dark fixation of l4C-bicerbonate were not measurably. influenced by ethylene, IAA or malate, either prior to or during the changes in growth ,ates induced by these agents. The data does not support the hypothesis that ethylene inhibition of growth results from an inhibition of dark fixation, but suggests that ethylene may inhibit a process which is subsequent to fixation.
Resumo:
In this paper, we study several tests for the equality of two unknown distributions. Two are based on empirical distribution functions, three others on nonparametric probability density estimates, and the last ones on differences between sample moments. We suggest controlling the size of such tests (under nonparametric assumptions) by using permutational versions of the tests jointly with the method of Monte Carlo tests properly adjusted to deal with discrete distributions. We also propose a combined test procedure, whose level is again perfectly controlled through the Monte Carlo test technique and has better power properties than the individual tests that are combined. Finally, in a simulation experiment, we show that the technique suggested provides perfect control of test size and that the new tests proposed can yield sizeable power improvements.