The clergy-Man's vade mecum : part II : containing the canonical codes of the primitive, universal, Eastern, and Western Church, Down to the Year of our Lord, DCCLXXXVII, done from the original Greek and Latin, omitting no Canon, Decree, or any part of them that is curious or instructive ; with explanatory notes, a large index, and a preface shewing the usefulness of the work; with some reflections on moderate-non-conformity, and the rights of the church

Mode of access: Internet.

Research and innovation in the building regulatory process : proceedings of the first NBS/NCSBCS joint conference, held in Providence, Rhode Island, on September 21-22, 1976, in conjunction with the ninth annual meeting of the National Conference of States on Building Codes and Standards (NCSBCS), inc. /

Mode of access: Internet.

The compilation of labor laws from the revised statutes and codes of Porto Rico, 1902-1916.

Mode of access: Internet.

Cowdery's new book of forms, being legal forms and precedents for court proceedings and business transactions, elaborately annotated. Especially adapted to the codes and statutes of Alaska, Arizona, California, Colorado, Idaho, Montana, Nevada, New Mexico, North Dakota, Oregon, South Dakota, Utah, Washington and Wyoming.

Other editions published under title: 1895: Forms and precedents; 1918: Form book; 1933: Forms.

Public key cryptography and error correcting codes as Ising models

We employ the methods of statistical physics to study the performance of Gallager type error-correcting codes. In this approach, the transmitted codeword comprises Boolean sums of the original message bits selected by two randomly-constructed sparse matrices. We show that a broad range of these codes potentially saturate Shannon's bound but are limited due to the decoding dynamics used. Other codes show sub-optimal performance but are not restricted by the decoding dynamics. We show how these codes may also be employed as a practical public-key cryptosystem and are of competitive performance to modern cyptographical methods.

Finite-connectivity spin-glass phase diagrams and low-density parity check codes

We obtain phase diagrams of regular and irregular finite-connectivity spin glasses. Contact is first established between properties of the phase diagram and the performance of low-density parity check (LDPC) codes within the replica symmetric (RS) ansatz. We then study the location of the dynamical and critical transition points of these systems within the one step replica symmetry breaking theory (RSB), extending similar calculations that have been performed in the past for the Bethe spin-glass problem. We observe that the location of the dynamical transition line does change within the RSB theory, in comparison with the results obtained in the RS case. For LDPC decoding of messages transmitted over the binary erasure channel we find, at zero temperature and rate R=14, an RS critical transition point at pc 0.67 while the critical RSB transition point is located at pc 0.7450±0.0050, to be compared with the corresponding Shannon bound 1-R. For the binary symmetric channel we show that the low temperature reentrant behavior of the dynamical transition line, observed within the RS ansatz, changes its location when the RSB ansatz is employed; the dynamical transition point occurs at higher values of the channel noise. Possible practical implications to improve the performance of the state-of-the-art error correcting codes are discussed. © 2006 The American Physical Society.

Statistical mechanics of broadcast channels using low-density parity-check codes

We investigate the use of Gallager's low-density parity-check (LDPC) codes in a degraded broadcast channel, one of the fundamental models in network information theory. Combining linear codes is a standard technique in practical network communication schemes and is known to provide better performance than simple time sharing methods when algebraic codes are used. The statistical physics based analysis shows that the practical performance of the suggested method, achieved by employing the belief propagation algorithm, is superior to that of LDPC based time sharing codes while the best performance, when received transmissions are optimally decoded, is bounded by the time sharing limit.

A hierarchy of phase transitions in optimal neuronal coding:from binary to M-ary discrete optimal codes

We have investigated how optimal coding for neural systems changes with the time available for decoding. Optimization was in terms of maximizing information transmission. We have estimated the parameters for Poisson neurons that optimize Shannon transinformation with the assumption of rate coding. We observed a hierarchy of phase transitions from binary coding, for small decoding times, toward discrete (M-ary) coding with two, three and more quantization levels for larger decoding times. We postulate that the presence of subpopulations with specific neural characteristics could be a signiture of an optimal population coding scheme and we use the mammalian auditory system as an example.

Warfarin toxicity: do discharge ICD-10 codes and yellow cards accurately identify serious adverse drug reactions?

Focal points: ICD-10 codings and spontaneous yellow card reports for warfarin toxicity were compared retrospectively over a one-year period Eighteen cases of ICD-10 coded warfarin toxicity were identified from a total of 55,811 coded episodes More than three times as many ADRs to warfarin were found by screening ICD-10 codes as were reported spontaneously using the yellow card scheme Valuable information is being lost to regulatory authorities and as recognised reporters to the yellow card scheme, pharmacists are well placed to report these ADRs, enhancing their role in the safe and appropriate prescribing of warfarin

On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes

Partially supported by the Technical University of Gabrovo under Grant C-801/2008

A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications

ACM Computing Classification System (1998): E.4.

(Table 1) Individual codes, haplotype codes, GenBank accession numbers for DNA sequences and sample locality of the analysed Betamorpha fusiformis specimens from the ANDEEP III expedition

Based on our current knowledge about population genetics, phylogeography and speciation, we begin to understand that the deep sea harbours more species than suggested in the past. Deep-sea soft-sediment environment in particular hosts a diverse and highly endemic invertebrate fauna. Very little is known about evolutionary processes that generate this remarkable species richness, the genetic variability and spatial distribution of deep-sea animals. In this study, phylogeographic patterns and the genetic variability among eight populations of the abundant and widespread deep-sea isopod morphospecies Betamorpha fusiformis [Barnard, K.H., 1920. Contributions to the crustacean fauna of South Africa. 6. Further additions to the list of marine isopods. Annals of the South African Museum 17, 319-438] were examined. A fragment of the mitochondrial 16S rRNA gene of 50 specimens and the complete nuclear 18S rRNA gene of 7 specimens were sequenced. The molecular data reveal high levels of genetic variability of both genes between populations, giving evidence for distinct monophyletic groups of haplotypes with average p-distances ranging from 0.0470 to 0.1440 (d-distances: 0.0592-0.2850) of the 16S rDNA, and 18S rDNA p-distances ranging between 0.0032 and 0.0174 (d-distances: 0.0033-0.0195). Intermediate values are absent. Our results show that widely distributed benthic deep-sea organisms of a homogeneous phenotype can be differentiated into genetically highly divergent populations. Sympatry of some genotypes indicates the existence of cryptic speciation. Flocks of closely related but genetically distinct species probably exist in other widespread benthic deep-sea asellotes and other Peracarida. Based on existing data we hypothesize that many widespread morphospecies are complexes of cryptic biological species (patchwork hypothesis).

Iterative Phase Optimization of Elementary Quantum Error Correcting Codes

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits, as errors can be fully characterized. For multiqubit operations, though, this is no longer the case, as in the most general case, analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments, additional electronic levels beyond the two-level system encoding the qubit have been used to enhance the capabilities of quantum-information processors, which additionally increases the number of parameters that need to be controlled. For the optimization of the experimental system for a given task (e.g., a quantum algorithm), one has to find a satisfactory error model and also efficient observables to estimate the parameters of the model. In this manuscript, we demonstrate a method to optimize the encoding procedure for a small quantum error correction code in the presence of unknown but constant phase shifts. The method, which we implement here on a small-scale linear ion-trap quantum computer, is readily applicable to other AMO platforms for quantum-information processing.

Benchmarking a modified version of the civ3 nonrelativistic atomic-structure code within Na-like-tungsten R -matrix calculations

In this work we explore the validity of employing a modified version of the nonrelativistic structure code civ3 for heavy, highly charged systems, using Na-like tungsten as a simple benchmark. Consequently, we present radiative and subsequent collisional atomic data compared with corresponding results from a fully relativistic structure and collisional model. Our motivation for this line of study is to benchmark civ3 against the relativistic grasp0 structure code. This is an important study as civ3 wave functions in nonrelativistic R-matrix calculations are computationally less expensive than their Dirac counterparts. There are very few existing data for the W LXIV ion in the literature with which we can compare except for an incomplete set of energy levels available from the NIST database. The overall accuracy of the present results is thus determined by the comparison between the civ3 and grasp0 structure codes alongside collisional atomic data computed by the R-matrix Breit-Pauli and Dirac codes. It is found that the electron-impact collision strengths and effective collision strengths computed by these differing methods are in good general agreement for the majority of the transitions considered, across a broad range of electron temperatures.