Fatigue apparatus for geometrically complex non-standardized specimens

Standard Test Methods (e.g. ASTM, DIN) for materials characterization in general, and for fatigue in particular, do not contemplate specimens with complex geometries, as well as the combination of axial and in-plane bending loads in their methodologies. The present study refers to some patents and the new configuration or configurations of specimens (non-standardized by the status quo of test methods) and a device developed to induce axial and bending combined forces resultants from axial loads applied by any one test equipment (dynamic or monotonic) which possesses such limitation, towards obtaining more realistic results on the fatigue behavior, or even basic mechanical properties, from geometrically complex structures. Motivated by a specific and geometrically complex aeronautic structure (motor-cradle), non-standardized welded tubular specimens made from AISI 4130 steel were fatigue-tested at room temperature, by using a constant amplitude sinusoidal load of 20 Hz frequency, load ratio R = 0.1 with and without the above referred auxiliary fatigue apparatus. The results showed the fatigue apparatus was efficient for introducing higher stress concentration factor at the welded specimen joints, consequently reducing the fatigue strength when compared to other conditions. From the obtained results it is possible to infer that with small modifications the proposed apparatus will be capable to test a great variety of specimen configurations such as: squared tubes and plates with welded or melted junctions, as well as other materials such as aluminum, titanium, composites, polymeric, plastics, etc. © 2009 Bentham Science Publishers Ltd.

The Rv1712 locus from Mycobacterium tuberculosis H37Rv codes for a functional CMP kinase that preferentially Phosphorylates dCMP

The Mycobacterium tuberculosis cmk gene, predicted to encode a CMP kinase (CMK), was cloned and expressed, and its product was purified to homogeneity. Steady-state kinetics confirmed that M. tuberculosis CMK is a monomer that preferentially phosphorylates CMP and dCMP by a sequential mechanism. A plausible role for CMK is discussed. Copyright © 2009, American Society for Microbiology. All Rights Reserved.

Encoding through generalized polynomial codes

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

Integrating open source codes for solid modeling and automatic mesh generation in FEM applications

The applications of the Finite Element Method (FEM) for three-dimensional domains are already well documented in the framework of Computational Electromagnetics. However, despite the power and reliability of this technique for solving partial differential equations, there are only a few examples of open source codes available and dedicated to the solid modeling and automatic constrained tetrahedralization, which are the most time consuming steps in a typical three-dimensional FEM simulation. Besides, these open source codes are usually developed separately by distinct software teams, and even under conflicting specifications. In this paper, we describe an experiment of open source code integration for solid modeling and automatic mesh generation. The integration strategy and techniques are discussed, and examples and performance results are given, specially for complicated and irregular volumes which are not simply connected. © 2011 IEEE.

Construction of perfect space-time codes

In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic to the hexagonal An 2 -rotated lattice, for any channel of any dimension n such that gcd{n, 3) = 1.

Commutative group codes in R4, R6, R8 and R16-Approaching the bound

Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices can be determined by a quotient of m-dimensional lattices when the sublattice has an orthogonal basis. We discuss here the existence of orthogonal sublattices of the lattices A2, D3, D4 and E8, which have the best packing density in their dimensions, in order to generate families of commutative group codes approaching the bound presented in Siqueira and Costa (2008) [14]. © 2013 Elsevier B.V. All rights reserved.

Comparison between the performances of a linear isolator and an isolator with a geometrically nonlinear damper

Pós-graduação em Engenharia Mecânica - FEIS

Delaunay Tetrahedralization of the Heart Based on Integration of Open Source Codes

The Finite Element Method (FEM) is a way of numerical solution applied in different areas, as simulations used in studies to improve cardiac ablation procedures. For this purpose, the meshes should have the same size and histological features of the focused structures. Some methods and tools used to generate tetrahedral meshes are limited mainly by the use conditions. In this paper, the integration of Open Source Softwares is presented as an alternative to solid modeling and automatic mesh generation. To demonstrate its efficiency, the cardiac structures were considered as a first application context: atriums, ventricles, valves, arteries and pericardium. The proposed method is feasible to obtain refined meshes in an acceptable time and with the required quality for simulations using FEM.

Exploring copper nanostructures as highly uniform and reproducible substrates for plasmon-enhanced fluorescence

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

On the Performance of a Two-Stage Vibration Isolation System Which has Geometrically Nonlinear Stiffness

Linear single-stage vibration isolation systems have a limitation on their performance, which can be overcome passively by using linear two-stage isolations systems. It has been demonstrated by several researchers that linear single-stage isolation systems can be improved upon by using nonlinear stiffness elements, especially for low-frequency vibrations. In this paper, an investigation is conducted into whether the same improvements can be made to a linear two-stage isolation system using the same methodology for both force and base excitation. The benefits of incorporating geometric stiffness nonlinearity in both upper and lower stages are studied. It is found that there are beneficial effects of using nonlinearity in the stiffness in both stages for both types of excitation. Further, it is found that this nonlinearity causes the transmissibility at the lower resonance frequency to bend to the right, but the transmissibility at the higher resonance frequency is not affected in the same way. Generally, it is found that a nonlinear two-stage system has superior isolation performance compared to that of a linear two-stage isolator.

Spectrum Distribution in Cognitive Radio: Error Correcting Codes Perspective

Cognitive radio is a growing zone in wireless communication which offers an opening in complete utilization of incompetently used frequency spectrum: deprived of crafting interference for the primary (authorized) user, the secondary user is indorsed to use the frequency band. Though, scheming a model with the least interference produced by the secondary user for primary user is a perplexing job. In this study we proposed a transmission model based on error correcting codes dealing with a countable number of pairs of primary and secondary users. However, we obtain an effective utilization of spectrum by the transmission of the pairs of primary and secondary users' data through the linear codes with different given lengths. Due to the techniques of error correcting codes we developed a number of schemes regarding an appropriate bandwidth distribution in cognitive radio.

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.

Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle

In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.