Français 189

Contient : 1° « Le Volume intitulé de Merveilles » ; 2° « Le Rommant des Sept Saiges »

Resolución N° 127 ¿Son aplicables por analogía las disposiciones del artículo 189 y 190 del código de comercio a las reuniones y actas de Junta directiva?¿Cuál es el alcance que debe tener la revisión de las actas por parte de la Cámara de Comercio Bogotá? El nombramiento de nuevo gerente y renuncia del anterior debe ser expresado con claridad en el acta.

Servicios registrales

Resolución N° 189 del 16 de julio de 2007 ¿En que consiste el principio de realidad regístral? ¿Cuáles son los elementos que la Cámara de Comercio evalúa en las actas de asamblea y de juntas directivas?

Servicios registrales

Production of poly(3-hydroxybutyrate-co-3-hydroxyvalerate) P(3HB-co-3HV) with a broad range of 3HV content at high yields by Burkholderia sacchari IPT 189

The biosynthesis of poly(3-hydroxybutyrate-co-3-hydroxyvalerate) from sucrose and propionic acid by Burkholderia sacchari IPT 189 was studied using a two-stage bioreactor process. In the first stage, this bacterium was cultivated in a balanced culture medium until sucrose exhaustion. In the second stage, a solution containing sucrose and propionic acid as carbon source was fed to the bioreactor at various sucrose/propionic acid (s/p) ratios at a constant specific flow rate. Copolymers with 3HV content ranging from 40 down to 6.5 (mol%) were obtained with 3HV yield from propionic acid (Y-3HV/prop) increasing from 1.10 to 1.34 g g(-1). Copolymer productivity of 1 g l(-1) h(-1) was obtained with polymer biomass content rising up to 60% by increasing a specific flow rate at a constant s/p ratio. Increasing values of 3HV content were obtained by varying the s/p ratios. A simulation of production costs considering Y-3HV/prop obtained in the present work indicated that a reduction of up to 73% can be reached, approximating US$ 1.00 per kg which is closer to the value to produce P3HB from sucrose (US$ 0.75 per kg).

A Brazilian registry of juvenile dermatomyositis: onset features and classification of 189 cases

ObjectiveTo describe onset features, classification and treatment of juvenile dermatomyositis (JDM) and juvenile polymyositis (JPM) from a multicentre registry.MethodsInclusion criteria were onset age lower than 18 years and a diagnosis of any idiopathic inflammatory myopathy (IIM) by attending physician. Bohan & Peter (1975) criteria categorisation was established by a scoring algorithm to define JDM and JPM based oil clinical protocol data.ResultsOf the 189 cases included, 178 were classified as JDM, 9 as JPM (19.8: 1) and 2 did not fit the criteria; 6.9% had features of chronic arthritis and connective tissue disease overlap. Diagnosis classification agreement occurred in 66.1%. Medial? onset age was 7 years, median follow-up duration was 3.6 years. Malignancy was described in 2 (1.1%) cases. Muscle weakness occurred in 95.8%; heliotrope rash 83.5%; Gottron plaques 83.1%; 92% had at least one abnormal muscle enzyme result. Muscle biopsy performed in 74.6% was abnormal in 91.5% and electromyogram performed in 39.2% resulted abnormal in 93.2%. Logistic regression analysis was done in 66 cases with all parameters assessed and only aldolase resulted significant, as independent variable for definite JDM (OR=5.4, 95%CI 1.2-24.4, p=0.03). Regarding treatment, 97.9% received steroids; 72% had in addition at least one: methotrexate (75.7%), hydroxychloroquine (64.7%), cyclosporine A (20.6%), IV immunoglobulin (20.6%), azathioprine (10.3%) or cyclophosphamide (9.6%). In this series 24.3% developed calcinosis and mortality rate was 4.2%.ConclusionEvaluation of predefined criteria set for a valid diagnosis indicated aldolase as the most important parameter associated with de, methotrexate combination, was the most indicated treatment.

Alternant and BCH codes over certain rings

Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of x s - 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore, we address the construction of BCH codes over Zm under Lee metric.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.

A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A BCH code and a sequence of cyclic codes

This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.