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.

Short term hydroelectric scheduling combining network flow and interior point approaches

In this paper, short term hydroelectric scheduling is formulated as a network flow optimization model and solved by interior point methods. The primal-dual and predictor-corrector versions of such interior point methods are developed and the resulting matrix structure is explored. This structure leads to very fast iterations since it avoids computation and factorization of impedance matrices. For each time interval, the linear algebra reduces to the solution of two linear systems, either to the number of buses or to the number of independent loops. Either matrix is invariant and can be factored off-line. As a consequence of such matrix manipulations, a linear system which changes at each iteration has to be solved, although its size is reduced to the number of generating units and is not a function of time intervals. These methods were applied to IEEE and Brazilian power systems, and numerical results were obtained using a MATLAB implementation. Both interior point methods proved to be robust and achieved fast convergence for all instances tested. (C) 2004 Elsevier Ltd. All rights reserved.

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.

Use of slag/sugar cane bagasse ash (SCBA) blends in the production of alkali-activated materials

Blast furnace slag (BFS)/sugar cane bagasse ash (SCBA) blends were assessed for the production of alkali-activated pastes and mortars. SCBA was collected from a lagoon in which wastes from a sugar cane industry were poured. After previous dry and grinding processes, SCBA was chemically characterized: it had a large percentage of organic matter (ca. 25%). Solutions of sodium hydroxide and sodium silicate were used as activating reagents. Different BFS/SCBA mixtures were studied, replacing part of the BFS by SCBA from 0 to 40% by weight. The mechanical strength of mortar was measured, obtaining values about 60 MPa of compressive strength for BFS/SCBA systems after 270 days of curing at 20 °C. Also, microstructural properties were assessed by means of SEM, TGA, XRD, pH, electrical conductivity, FTIR spectroscopy and MIP. Results showed a good stability of matrices developed by means of alkali-activation. It was demonstrated that sugar cane bagasse ash is an interesting source for preparing alkali-activated binders. © 2013 by the authors; licensee MDPI, Basel, Switzerland.

Momentos nulos e regularidade wavelet na detecção de falhas em sinais

Pós-graduação em Engenharia Elétrica - FEIS

Studies of azimuthal dihadron correlations in ultra-central PbPb collisions at=2.76 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

WEAR OF MATRIX OVERDENTURE ATTACHMENTS AFTER ONE TO EIGHT YEARS OF CLINICAL USE

Statement of problem. Matrices of unsplinted attachment systems are generally reported to be the weak component of implant overdentures, often requiring frequent maintenance. Clinical wear results in reduced retention of the prosthesis, requiring activation or renewal of the matrix to restore the initial level of retention. Purpose. The purpose of this retrospective study was to measure the wear of the matrix of a ball attachment after various periods of clinical wear. Material and methods. Seventy specimens of 3 groups of matrices of ball attachments that had been in use for mean periods of 12.3 months (1Y group, n=26), 39.0 months (3Y group, n=28) and 95.6 months (8Y group, n=16) were retrieved from 35 patients (2 specimens per patient) and measured on a coordinate measuring machine equipped with a touch trigger probe. Ten unused matrices were used as controls (CTRL group). The external and internal matrix diameters and deviations from circularity were measured. For the various time periods, the decreases in matrix thickness were calculated and compared with controls. Kruskal-Wallis 1-way ANOVA by ranks, followed by the Mann-Whitney post hoc tests, were conducted to test for differences in median values among groups (alpha=.05). Results. For the internal upper diameter of the matrices tested, the Kruskal-Wallis and Mann-Whitney tests revealed significant differences for the 3 groups compared to the controls. For group 1Y, a significant difference (P<.001) of the internal upper diameter was found compared to the CTRL group. Compared to the controls, the nonparametric analyses for groups 3Y and 8Y showed significant differences for the internal upper diameter (P<.001) and deviations from circularity (P<.001). For groups 1Y, 3Y and 8Y, matrix thickness losses were 07, 47 and 70 pm, respectively. Conclusions. Within the limitations of this study, it was observed that one year of clinical wear had limited effect on the ball attachment matrices. Three to 8 years of clinical use resulted in a significant decrease of matrix thickness, especially at the tip of the retentive lamellae. (J Prosthet Dent 2012;107:191-198)

Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks

Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provade a very Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that interferences can be performed in time linear in the number of nodes if there is a single observed node. Because our proof is construtive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynominal-time algorithm for SQPn. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.

Multimodality and flexibility of stochastic gene expression

We consider a general class of mathematical models for stochastic gene expression where the transcription rate is allowed to depend on a promoter state variable that can take an arbitrary (finite) number of values. We provide the solution of the master equations in the stationary limit, based on a factorization of the stochastic transition matrix that separates timescales and relative interaction strengths, and we express its entries in terms of parameters that have a natural physical and/or biological interpretation. The solution illustrates the capacity of multiple states promoters to generate multimodal distributions of gene products, without the need for feedback. Furthermore, using the example of a three states promoter operating at low, high, and intermediate expression levels, we show that using multiple states operons will typically lead to a significant reduction of noise in the system. The underlying mechanism is that a three-states promoter can change its level of expression from low to high by passing through an intermediate state with a much smaller increase of fluctuations than by means of a direct transition.

Design and Computation of Warped Time-Frequency Transforms

In this work we introduce an analytical approach for the frequency warping transform. Criteria for the design of operators based on arbitrary warping maps are provided and an algorithm carrying out a fast computation is defined. Such operators can be used to shape the tiling of time-frequency plane in a flexible way. Moreover, they are designed to be inverted by the application of their adjoint operator. According to the proposed mathematical model, the frequency warping transform is computed by considering two additive operators: the first one represents its nonuniform Fourier transform approximation and the second one suppresses aliasing. The first operator is known to be analytically characterized and fast computable by various interpolation approaches. A factorization of the second operator is found for arbitrary shaped non-smooth warping maps. By properly truncating the operators involved in the factorization, the computation turns out to be fast without compromising accuracy.

On differential operators of Calabi-Yau type

This thesis is devoted to the study of Picard-Fuchs operators associated to one-parameter families of $n$-dimensional Calabi-Yau manifolds whose solutions are integrals of $(n,0)$-forms over locally constant $n$-cycles. Assuming additional conditions on these families, we describe algebraic properties of these operators which leads to the purely algebraic notion of operators of CY-type. rnMoreover, we present an explicit way to construct CY-type operators which have a linearly rigid monodromy tuple. Therefore, we first usernthe translation of the existence algorithm by N. Katz for rigid local systems to the level of tuples of matrices which was established by M. Dettweiler and S. Reiter. An appropriate translation to the level of differential operators yields families which contain operators of CY-type. rnConsidering additional operations, we are also able to construct special CY-type operators of degree four which have a non-linearly rigid monodromy tuple. This provides both previously known and new examples.

Novel algorithms for electronic structure based molecular dynamics with linear system-size scaling

Die vorliegende Arbeit behandelt die Entwicklung und Verbesserung von linear skalierenden Algorithmen für Elektronenstruktur basierte Molekulardynamik. Molekulardynamik ist eine Methode zur Computersimulation des komplexen Zusammenspiels zwischen Atomen und Molekülen bei endlicher Temperatur. Ein entscheidender Vorteil dieser Methode ist ihre hohe Genauigkeit und Vorhersagekraft. Allerdings verhindert der Rechenaufwand, welcher grundsätzlich kubisch mit der Anzahl der Atome skaliert, die Anwendung auf große Systeme und lange Zeitskalen. Ausgehend von einem neuen Formalismus, basierend auf dem großkanonischen Potential und einer Faktorisierung der Dichtematrix, wird die Diagonalisierung der entsprechenden Hamiltonmatrix vermieden. Dieser nutzt aus, dass die Hamilton- und die Dichtematrix aufgrund von Lokalisierung dünn besetzt sind. Das reduziert den Rechenaufwand so, dass er linear mit der Systemgröße skaliert. Um seine Effizienz zu demonstrieren, wird der daraus entstehende Algorithmus auf ein System mit flüssigem Methan angewandt, das extremem Druck (etwa 100 GPa) und extremer Temperatur (2000 - 8000 K) ausgesetzt ist. In der Simulation dissoziiert Methan bei Temperaturen oberhalb von 4000 K. Die Bildung von sp²-gebundenem polymerischen Kohlenstoff wird beobachtet. Die Simulationen liefern keinen Hinweis auf die Entstehung von Diamant und wirken sich daher auf die bisherigen Planetenmodelle von Neptun und Uranus aus. Da das Umgehen der Diagonalisierung der Hamiltonmatrix die Inversion von Matrizen mit sich bringt, wird zusätzlich das Problem behandelt, eine (inverse) p-te Wurzel einer gegebenen Matrix zu berechnen. Dies resultiert in einer neuen Formel für symmetrisch positiv definite Matrizen. Sie verallgemeinert die Newton-Schulz Iteration, Altmans Formel für beschränkte und nicht singuläre Operatoren und Newtons Methode zur Berechnung von Nullstellen von Funktionen. Der Nachweis wird erbracht, dass die Konvergenzordnung immer mindestens quadratisch ist und adaptives Anpassen eines Parameters q in allen Fällen zu besseren Ergebnissen führt.

An intervention mapping approach: Identification of human trafficking victims by health professionals

Background. Today modern day slavery is known as human trafficking and is a growing pandemic that is a grave human rights violation. Estimates suggest that 12.3 million people are working under conditions of force, fraud or coercion. Working toward eradication is a worthy effort; it would free millions of humans from slavery, mostly women and children, as well as uphold basic human rights. One tactic to eradicating human trafficking is to increase identification of victims among those likely to encounter victims of human trafficking.^ Purpose. This study aims to develop an intervention that improves certain stakeholders' ability, in the health clinic setting, to appropriately identify and report victims of human trafficking to the National Human Trafficking Resource Center.^ Methods. The Intervention Mapping (IM) process was used by program planners to develop an intervention for health professionals. This methodology is a six step process that guides program planners to develop an intervention. Each step builds on the others through the execution of a needs assessment, and the development of matrices based on performance objectives and determinants of the targeted health behavior. The end product results in an ecological, theoretical, and evidence based intervention.^ Discussion. The IM process served as a useful protocol for program planners to take an ecological approach as well as incorporate theory and evidence into the intervention. Consultation with key informants, the planning group, adopters, implementers, and individuals responsible for institutionalization also contributed to the practicality and feasibility of the intervention. Program planners believe that this intervention fully meets recommendations set forth in the literature.^ Conclusions. The intervention mapping methodology enabled program planners to develop an intervention that is appropriate and acceptable to the implementer and the recipients.^

Numerical model for the study of hydrodynamics on bays and estuaries

A nonlinear implicit finite element model for the solution of two-dimensional (2-D) shallow water equations, based on a Galerkin formulation of the 2-D estuaries hydrodynamic equations, has been developed. Spatial discretization has been achieved by the use of isoparametric, Lagrangian elements. To obtain the different element matrices, Simpson numerical integration has been applied. For time integration of the model, several schemes in finite differences have been used: the Cranck-Nicholson iterative method supplies a superior accuracy and allows us to work with the greatest time step Δt; however, central differences time integration produces a greater velocity of calculation. The model has been tested with different examples to check its accuracy and advantages in relation to computation and handling of matrices. Finally, an application to the Bay of Santander is also presented.

LR property of non-well-formed scales

This article studies generated scales having exactly three different step sizes within the language of algebraic combinatorics on words. These scales and their corresponding step-patterns are called non well formed. We prove that they can be naturally inserted in the Christoffel tree of well-formed words. Our primary focus in this study is on the left- and right-Lyndon factorization of these words. We will characterize the non-well-formed words for which both factorizations coincide. We say that these words satisfy the LR property and show that the LR property is satisfied exactly for half of the non-well-formed words. These are symmetrically distributed in the extended Christoffel tree. Moreover, we find a surprising connection between the LR property and the Christoffel duality. Finally, we prove that there are infinitely many Christoffel–Lyndon words among the set of non-well-formed words and thus there are infinitely many generated scales having as step-pattern a Christoffel–Lyndon word.