865 resultados para Cipher and telegraph codes
Resumo:
Objetivou-se compreender a possibilidade de o ecossistema domiciliar de pais portadores de morbidades cardiovasculares propiciar atitudes e comportamentos que corroborem para manifestações análogas na saúde dos filhos que convivem neste ambiente, e compreender como o cuidado de enfermagem/saúde com ações interativas de promoção de saúde domiciliar seja capaz de dissipar estas atitudes e comportamentos nos filhos. Para o conhecimento, a compreensão, interação do ecossistema domiciliar e o modo de viver dos filhos de pai/mãe cardiopata como um processo dinâmico e inter-relacional, foi utilizada a abordagem sistêmica de Ilya Prigogine, com enfoque nos princípios ecossistêmicos. O percurso metodológico se baseou na Teoria Fundamentada nos Dados, que, de maneira sistemática, interativa e criativa, possibilitou o desenvolvimento da teoria formal: Compreendendo possibilidades Interativas de orientações da Enfermagem/Saúde no Ecossistema domiciliar dos filhos de pais cardiopatas para mudanças de comportamentos e atitudes. Esta é uma teoria fidedigna e fundamentada nos dados da pesquisa, que culminou com o desenvolvimento de suas categorias. A coleta e análise dos dados foram realizadas conforme a preconização da teoria, de forma comparativa e constante, seguindo os passos: codificação inicial ou aberta, categorização e codificação teórica, sendo utilizada também a observação. Totalizou a amostra teórica onze filhos de pai/mãe cardiopatas, entrevistados no Brasil e em Portugal, onde, neste último, foi realizado um Intercâmbio de Doutorado com a finalidade de potencializar os conceitos e direcionar novas possibilidades aos fenômenos apresentados. Como processo de análise dos dados e agrupamento das categorias utilizou-se o modelo paradigmático desenvolvido por Glaser (1968) correspondente à família de códigos 6 Cs e de códigos interativos. A teoria formal emergiu a partir de dois fenômenos e suas categorias. O fenômeno, Conhecendo o ecossistema domiciliar de filhos de pai/mãe cardiopata na perspectiva das orientações da enfermagem/saúde, englobou as categorias: Demonstrando conhecimento sobre aspectos que possibilitam o infarto (condição causal); Associando a vivência da doença e orientações às modificações no modo de viver (condição estratégica); Relatando possibilidades de orientações para os filhos de pai/mãe cardiopata (condição de contingência); Reconhecendo a importância das orientações para o viver melhor (condição de consequência). Em relação ao fenômeno Conhecendo comportamentos e atitudes de filhos de pai/mãe cardiopata, as categorias elencadas foram: Descrevendo atitudes e comportamentos do(a) filho(a) antes da doença do(a) pai/mãe (condição causal); Relatando comportamentos e atitudes dos filhos pós-doença do(a) pai/mãe (condição estratégica); Reconhecendo a importância da mudança de comportamentos e atitudes para um viver saudável (condição de consequência). A teoria que emergiu por meio dos dados deste trabalho fundamenta a importância das ações de enfermagem/saúde para a promoção da saúde, confirma a tese proposta no projeto de pesquisa e permite concluir que a perspectiva ecossistêmica direciona para o conhecimento, a compreensão e discussão, evidentemente, mais amplos, dos contextos apresentados, pelas suas dinâmicas e interatividades.
Resumo:
Dissertação (mestrado)—Universidade de Brasília, Faculdade de Ciência da Informação, Programa de Pós-Graduação em Ciência da Informação, 2016.
Resumo:
El interés de este Estudio de Caso es identificar y explicar los alcances de la construcción de memoria en la sociedad colombiana, no sólo como elemento de no olvido sino también como herramienta de resistencia y de acción de aquellos que la construyen y reconstruyen. Por ello, la investigación pretende determinar el vínculo existente entre memoria y participación política, analizando y explicando la manera como mujeres pertenecientes a Ruta Pacífica de las Mujeres han construido memoria respecto a los procesos de violencia que enfrentan y la forma como ello ha hecho posible la consolidación de una identidad colectiva por medio de la cual resisten a la violencia y a los códigos culturales que la perpetúan. En consecuencia, se efectúa un análisis a los documentos elaborados por Ruta Pacífica respecto a construcción de memoria y junto con ello, un examen a los procesos participativos que han adelantado las mujeres pertenecientes a Ruta Pacífica.
Resumo:
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for their cardinality in terms of minimum distance and the maximum center density of lattices and general spherical packings in the half dimension of the code. This bound is tight in the sense it can be arbitrarily approached in any dimension. Examples of this approach and a comparison of this bound with Union and Rankin bounds for general spherical codes is also presented.
Resumo:
The influence of initial perturbation geometry and material propel-ties on final fold geometry has been investigated using finite-difference (FLAC) and finite-element (MARC) numerical models. Previous studies using these two different codes reported very different folding behaviour although the material properties, boundary conditions and initial perturbation geometries were similar. The current results establish that the discrepancy was not due to the different computer codes but due to the different strain rates employed in the two previous studies (i.e. 10(-6) s(-1) in the FLAC models and 10(-14) s(-1) in the MARC models). As a result, different parts of the elasto-viscous rheological field were bring investigated. For the same material properties, strain rate and boundary conditions, the present results using the two different codes are consistent. A transition in Folding behaviour, from a situation where the geometry of initial perturbation determines final fold shape to a situation where material properties control the final geometry, is produced using both models. This transition takes place with increasing strain rate, decreasing elastic moduli or increasing viscosity (reflecting in each case the increasing influence of the elastic component in the Maxwell elastoviscous rheology). The transition described here is mechanically feasible but is associated with very high stresses in the competent layer (on the order of GPa), which is improbable under natural conditions. (C) 2000 Elsevier Science Ltd. All rights reserved.
Resumo:
IPH submitted their views on the Draft BAI General and Commercial Communications Code. IPH previously submitted views to the BAI in the first phase of consultation (Oct 2011). The final code will regulate the advertising of food and non-alcoholic beverages that are high in fat, salt or sugar on Irish television channels. The submission sets out approaches to appropriate scheduling and content restrictions as well as to possible exemptions.
Resumo:
This research is aimed to find a solution for a distributed storage system adapted for CoDeS. By studying how DSSs work and how they are implemented, we can conclude how we can implement a DSS compatible with CoDeS requirements.
Resumo:
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.
Resumo:
We show how to build full-diversity product codes under both iterative encoding and decoding over non-ergodic channels, in presence of block erasure and block fading. The concept of a rootcheck or a root subcode is introduced by generalizing the same principle recently invented for low-density parity-check codes. We also describe some channel related graphical properties of the new family of product codes, a familyreferred to as root product codes.
Resumo:
This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.
Resumo:
The computer simulation of reaction dynamics has nowadays reached a remarkable degree of accuracy. Triatomic elementary reactions are rigorously studied with great detail on a straightforward basis using a considerable variety of Quantum Dynamics computational tools available to the scientific community. In our contribution we compare the performance of two quantum scattering codes in the computation of reaction cross sections of a triatomic benchmark reaction such as the gas phase reaction Ne + H2+ %12. NeH++ H. The computational codes are selected as representative of time-dependent (Real Wave Packet [ ]) and time-independent (ABC [ ]) methodologies. The main conclusion to be drawn from our study is that both strategies are, to a great extent, not competing but rather complementary. While time-dependent calculations advantages with respect to the energy range that can be covered in a single simulation, time-independent approaches offer much more detailed information from each single energy calculation. Further details such as the calculation of reactivity at very low collision energies or the computational effort related to account for the Coriolis couplings are analyzed in this paper.
Resumo:
A new coding technique to be used in steganography is evaluated. The performanceof this new technique is computed and comparisons with the well-known theoreticalupper bound, Hamming upper bound and basic LSB are established.