Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

The cultural industry and new codes of modernity

Includes bibliography

Weight vs magnetization enumerator for Gallager codes

We propose a method to determine the critical noise level for decoding Gallager type low density parity check error correcting codes. The method is based on the magnetization enumerator (¸M), rather than on the weight enumerator (¸W) presented recently in the information theory literature. The interpretation of our method is appealingly simple, and the relation between the different decoding schemes such as typical pairs decoding, MAP, and finite temperature decoding (MPM) becomes clear. Our results are more optimistic than those derived via the methods of information theory and are in excellent agreement with recent results from another statistical physics approach.

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.

Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.

On the Weight Distribution of the Coset Leaders of Constacyclic Codes

Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution of the coset leaders as a suitable cyclic code.

Minimal Codewords in Linear Codes

2000 Mathematics Subject Classification: 94B05, 94B15.

Effects Of Therapeutic Approach On The Neonatal Evolution Of Very Low Birth Weight Infants With Patent Ductus Arteriosus.

To analyze the effects of treatment approach on the outcomes of newborns (birth weight [BW] < 1,000 g) with patent ductus arteriosus (PDA), from the Brazilian Neonatal Research Network (BNRN) on: death, bronchopulmonary dysplasia (BPD), severe intraventricular hemorrhage (IVH III/IV), retinopathy of prematurity requiring surgical (ROPsur), necrotizing enterocolitis requiring surgery (NECsur), and death/BPD. This was a multicentric, cohort study, retrospective data collection, including newborns (BW < 1000 g) with gestational age (GA) < 33 weeks and echocardiographic diagnosis of PDA, from 16 neonatal units of the BNRN from January 1, 2010 to Dec 31, 2011. Newborns who died or were transferred until the third day of life, and those with presence of congenital malformation or infection were excluded. Groups: G1 - conservative approach (without treatment), G2 - pharmacologic (indomethacin or ibuprofen), G3 - surgical ligation (independent of previous treatment). Factors analyzed: antenatal corticosteroid, cesarean section, BW, GA, 5 min. Apgar score < 4, male gender, Score for Neonatal Acute Physiology Perinatal Extension (SNAPPE II), respiratory distress syndrome (RDS), late sepsis (LS), mechanical ventilation (MV), surfactant (< 2 h of life), and time of MV. death, O2 dependence at 36 weeks (BPD36wks), IVH III/IV, ROPsur, NECsur, and death/BPD36wks. Student's t-test, chi-squared test, or Fisher's exact test; Odds ratio (95% CI); logistic binary regression and backward stepwise multiple regression. Software: MedCalc (Medical Calculator) software, version 12.1.4.0. p-values < 0.05 were considered statistically significant. 1,097 newborns were selected and 494 newborns were included: G1 - 187 (37.8%), G2 - 205 (41.5%), and G3 - 102 (20.6%). The highest mortality was observed in G1 (51.3%) and the lowest in G3 (14.7%). The highest frequencies of BPD36wks (70.6%) and ROPsur were observed in G3 (23.5%). The lowest occurrence of death/BPD36wks occurred in G2 (58.0%). Pharmacological (OR 0.29; 95% CI: 0.14-0.62) and conservative (OR 0.34; 95% CI: 0.14-0.79) treatments were protective for the outcome death/BPD36wks. The conservative approach of PDA was associated to high mortality, the surgical approach to the occurrence of BPD36wks and ROPsur, and the pharmacological treatment was protective for the outcome death/BPD36wks.

Comparison between constant and decreasing rest intervals: influence on maximal strength and hypertrophy

de Souza Jr, TP, Fleck, SJ, Simao, R, Dubas, JP, Pereira, B, de Brito Pacheco, EM, da Silva, AC, and de Oliveira, PR. Comparison between constant and decreasing rest intervals: influence on maximal strength and hypertrophy. J Strength Cond Res 24(7): 1843-1850, 2010-Most resistance training programs use constant rest period lengths between sets and exercises, but some programs use decreasing rest period lengths as training progresses. The aim of this study was to compare the effect on strength and hypertrophy of 8 weeks of resistance training using constant rest intervals (CIs) and decreasing rest intervals (DIs) between sets and exercises. Twenty young men recreationally trained in strength training were randomly assigned to either a CI or DI training group. During the first 2 weeks of training, 3 sets of 10-12 repetition maximum (RM) with 2-minute rest intervals between sets and exercises were performed by both groups. During the next 6 weeks of training, the CI group trained using 2 minutes between sets and exercises (4 sets of 8-10RM), and the DI group trained with DIs (2 minutes decreasing to 30 seconds) as the 6 weeks of training progressed (4 sets of 8-10RM). Total training volume of the bench press and squat were significantly lower for the DI compared to the CI group (bench press 9.4%, squat 13.9%) and weekly training volume of these same exercises was lower in the DI group from weeks 6 to 8 of training. Strength (1RM) in the bench press and squat, knee extensor and flexor isokinetic measures of peak torque, and muscle cross-sectional area (CSA) using magnetic resonance imaging were assessed pretraining and posttraining. No significant differences (p <= 0.05) were shown between the CI and DI training protocols for CSA (arm 13.8 vs. 14.5%, thigh 16.6 vs. 16.3%), 1RM (bench press 28 vs. 37%, squat 34 vs. 34%), and isokinetic peak torque. In conclusion, the results indicate that a training protocol with DI is just as effective as a CI protocol over short training periods (6 weeks) for increasing maximal strength and muscle CSA; thus, either type of program can be used over a short training period to cause strength and hypertrophy.

Batch distillation: Better at constant or variable reflux?

Due to its outstanding flexibility, batch distillation is still widely used in many separation processes. In the present work, a comparison between constant and variable reflux operations is studied. Firstly, a mathematical model is developed and then validated through comparison between predicted and experimental results accomplished in a lab-scale apparatus. Therefore, case studies are performed through mathematical simulations. It is noted that the most economical form of batch distillation is at constant overhead product composition, keeping the flow rate of vapor from the top of the column constant. (C) 2010 Elsevier B.V. All rights reserved.

An extension of the Pitzer equation for the excess Gibbs energy of aqueous electrolyte systems to aqueous polyelectrolyte solutions

Pitzer`s equation for the excess Gibbs energy of aqueous solutions of low-molecular electrolytes is extended to aqueous solutions of polyelectrolytes. The model retains the original form of Pitzer`s model (combining a long-range term, based on the Debye-Huckel equation, with a short-range term similar to the virial equation where the second osmotic virial coefficient depends on the ionic strength). The extension consists of two parts: at first, it is assumed that a constant fraction of the monomer units of the polyelectrolyte is dissociated, i.e., that fraction does not depend on the concentration of the polyelectrolyte, and at second, a modified expression for the ionic strength (wherein each charged monomer group is taken into account individually) is introduced. This modification is to account for the presence of charged polyelectrolyte chains, which cannot be regarded as punctual charges. The resulting equation was used to correlate osmotic coefficient data of aqueous solutions of a single polyelectrolyte as well as of binary mixtures of a single polyelectrolyte and a salt with low-molecular weight. It was additionally applied to correlate liquid-liquid equilibrium data of some aqueous two-phase systems that might form when a polyelectrolyte and another hydrophilic but neutral polymer are simultaneously dissolved in water. A good agreement between the experimental data and the correlation result is observed for all investigated systems. (c) 2008 Elsevier B.V. All rights reserved.

A Geometric Approach for Turbo Decoding of Reed-Solomon Codes in QAM Modulation Schemes

This work studies the turbo decoding of Reed-Solomon codes in QAM modulation schemes for additive white Gaussian noise channels (AWGN) by using a geometric approach. Considering the relations between the Galois field elements of the Reed-Solomon code and the symbols combined with their geometric dispositions in the QAM constellation, a turbo decoding algorithm, based on the work of Chase and Pyndiah, is developed. Simulation results show that the performance achieved is similar to the one obtained with the pragmatic approach with binary decomposition and analysis.

Protein Intake during Weight Loss Influences the Energy Required for Weight Loss and Maintenance in Cats

The effects of 2 diets with different protein contents on weight loss and subsequent maintenance was assessed in obese cats. The control group [Cc; n = 8; body condition score (BCS) = 8.6 +/- 0.2] received a diet containing 21.4 g crude protein (CP)/MJ of metabolizable energy and the high-protein group (HP; n = 7; BCS = 8.6 +/- 0.2) received a diet containing 28.4 g CP/MJ until the cats achieved a 20% controlled weight loss (0.92 +/- 0.2%/wk). After the weight loss, the cats were all fed a diet containing 28.0 g CP/MJ at an amount sufficient to maintain a constant body weight (MAIN) for 120 d. During weight loss, there was a reduction of lean mass in Cc (P < 0.01) but not in HIP cats and a reduction in leptinemia in both groups (P < 0.01). Energy intake per kilogram of metabolic weight (kg(-0.40)) to maintain the same rate of weight loss was lower (P < 0.04) in the Co (344 +/- 15.9 kJ.kg(-0.40).d(-1)) than in the HP group (377 +/- 12.4 kJ.kg-(0.40).d(-1)). During the first 40 d of MAIN, the energy requirement for weight maintenance was 398.7 +/- 9.7 kJ.kg(-0.40).d(-1) for both groups, corresponding to 73% of the NRC recommendation. The required energy gradually increased in both groups (P < 0.05) but at a faster rate in HP; therefore, the energy consumption during the last 40 d of the MAIN was higher (P < 0.001) for the HP cats (533.8 +/- 7.4 kJ.kg(-0.40).d(-1)) than for the control cats (462.3 +/- 9.6 kJ.kg(-0.40).d(-1)). These findings suggest that HIP diets allow a higher energy intake to weight loss in cats, reducing the intensity of energy restriction. Protein intake also seemed to have long-term effects so that weight maintenance required more energy after weight loss. J. Nutr, 139: 855-860, 2009.

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg G less than or equal to n-2/2 or deg G greater than or equal to n-2/2 + 2g then the state complexity of C-L(D, G) is equal to the Wolf bound. For deg G is an element of [n-1/2, n-3/2 + 2g], we use Clifford's theorem to give a simple lower bound on the state complexity of C-L(D, G). We then derive two further lower bounds on the state space dimensions of C-L(D, G) in terms of the gonality sequence of F/F-q. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of C-L(D, G) and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.