Preparation, characterization and application of a nanostructured composite: Octakis(cyanopropyldimethylsiloxy)octasilsesquioxane

Octakis(cyanopropyldimethylsiloxy)octasilsesquioxane was prepared and characterized by C-13, Si-29 NMR (MAS), SEM, FF-IR, XRD and thermogravimetric techniques. The four groups alpha, beta, gamma, kappa (to the terminal silicon atom), associated with an acrylonitrile, were clearly seen in the C-13 NMR (alpha-CH2 at 17.9; P-CH2 at 31.3; gamma-CH, at 50.4; K-C N at 59.0 ppm). The Si-29 NMR spectrum of the final product, exhibits only Q type silicon signal, ascribed to Q(4) (-118.0 ppm). The presence of acrylonittile substituted for octameric cube confers a relative change phase and thermal stability to the material. With regard to the applications for this new material, it was intended, in this case, to react with Na-2[Fe(CN)(5)NH3] by chemical substitution. This composite was incorporated into a carbon paste electrode and the electrochemical studies were performed by cyclic voltammetry. The cyclic voltammogram of the modified graphite paste electrode, showed one redox couples with formal potential (E-1/2(ox)) = 0.24 V versus SCE. (c) 2006 Elsevier B.V. All rights reserved.

Otimização de metodologias para determinação de hidrocarbonetos policíclicos aromáticos:aplicação em água do Rio Potengi

This work aims to detect polycyclic aromatic hydrocarbons (PAHs) through optimized analytical techniques, such as gas chromatography with flame-ionisation detector (CGFID), gas chromatography coupled to mass spectrometry (CGMS), Fluorescence Spectroscopy of Molecular and Purpot of oils and greases (POG). Apply to chemometrics, Factorial Planning 23, in the preparation of samples by liquid-liquid extraction. The sample preparation was used for liquid-liquid extraction and factors in this sample was used for the application of factorial planning 23, such as the use of ultrasound, solvents (dichloromethane, hexane and chloroform) and ratio of solvent / synthetic sample. These factors were assigned two types of levels: positive and negative. It was used to form the cube to better analyze the answers. The responses of the eight combinations were obtained in reading the spectrofluorimetric. The optimization of equipment were used, and they served in the HPA's identification of the samples collected in Rio Potengi. The optimization of the equipment was observed every 16's and PAH in the samples was found that the HPA's came from contamination of the Rio Potengi. The contamination comes through organic household waste, hospital waste, and among other contamination that comes from industries that are installed around the River The factorial design of high validity, it was observed a more effective sample preparation. The factorial design of liquid-liquid extraction showed a way to spend less solvent in less time using an ideal solvent, but also a way to extract more analyte from the matrix itself is water. In planning a smaller form factor extraction was the use of ultrasound, the ratio 1:3 corresponding to a solvent and sample 3 and the best solvent was dichloromethane who presented a viable extraction, not discarding the possibility of using also the hexane. The chloroform and may be toxic not had a good extraction

Critical temperature for first-order phase transitions in confined systems

We consider the Euclidean D-dimensional -lambda vertical bar phi vertical bar(4)+eta vertical bar rho vertical bar(6) (lambda,eta > 0) model with d (d <= D) compactified dimensions. Introducing temperature by means of the Ginzburg-Landau prescription in the mass term of the Hamiltonian, this model can be interpreted as describing a first-order phase transition for a system in a region of the D-dimensional space, limited by d pairs of parallel planes, orthogonal to the coordinates axis x(1), x(2),..., x(d). The planes in each pair are separated by distances L-1, L-2, ... , L-d. We obtain an expression for the transition temperature as a function of the size of the system, T-c({L-i}), i = 1, 2, ..., d. For D = 3 we particularize this formula, taking L-1 = L-2 = ... = L-d = L for the physically interesting cases d = 1 (a film), d = 2 (an infinitely long wire having a square cross-section), and for d = 3 (a cube). For completeness, the corresponding formulas for second-order transitions are also presented. Comparison with experimental data for superconducting films and wires shows qualitative agreement with our theoretical expressions.

Photoluminescence properties of PZT 52/48 synthesized by microwave hydrothermal method using PVA with template

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

Photoluminescence properties and synthesis of a PZT mesostructure obtained by the microwave-assisted hydrothermal method

Micro-cube-shaped lead zirconate titanate was synthesized using the microwave-assisted hydrothermal method. Photoluminescence and field emission scanning electron microscopy were used for monitoring the formation of mesocrystals. Based on these results, a growth mechanism was then proposed which involved nanoparticle aggregation, nanoplate self-assembly on specific architecture and the final formation of mesoscopic micro-cube-shaped lead zirconate titanate. (C) 2011 Elsevier B. V. All rights reserved.

Relating propelinear and binary G-linear codes

In this paper we establish the connections between two different extensions of Z(4)-linearity for binary Hamming spaces, We present both notions - propelinearity and G-linearity - in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and translation-invariant propelinear codes are G-linear codes. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Optimum-Path Forest Classifier for Large Scale Biometric Applications

This paper addresses biometric identification using large databases, in particular, iris databases. In such applications, it is critical to have low response time, while maintaining an acceptable recognition rate. Thus, the trade-off between speed and accuracy must be evaluated for processing and recognition parts of an identification system. In this paper, a graph-based framework for pattern recognition, called Optimum-Path Forest (OPF), is utilized as a classifier in a pre-developed iris recognition system. The aim of this paper is to verify the effectiveness of OPF in the field of iris recognition, and its performance for various scale iris databases. The existing Gauss-Laguerre Wavelet based coding scheme is used for iris encoding. The performance of the OPF and two other - Hamming and Bayesian - classifiers, is compared using small, medium, and large-scale databases. Such a comparison shows that the OPF has faster response for large-scale databases, thus performing better than the more accurate, but slower, classifiers.

A Fast Large Scale Iris Database Classification with Optimum-Path Forest Technique: A Case Study

Majority of biometric researchers focus on the accuracy of matching using biometrics databases, including iris databases, while the scalability and speed issues have been neglected. In the applications such as identification in airports and borders, it is critical for the identification system to have low-time response. In this paper, a graph-based framework for pattern recognition, called Optimum-Path Forest (OPF), is utilized as a classifier in a pre-developed iris recognition system. The aim of this paper is to verify the effectiveness of OPF in the field of iris recognition, and its performance for various scale iris databases. This paper investigates several classifiers, which are widely used in iris recognition papers, and the response time along with accuracy. The existing Gauss-Laguerre Wavelet based iris coding scheme, which shows perfect discrimination with rotary Hamming distance classifier, is used for iris coding. The performance of classifiers is compared using small, medium, and large scale databases. Such comparison shows that OPF has faster response for large scale database, thus performing better than more accurate but slower Bayesian classifier.

Line based camera calibration in machine vision dynamic applications

The problem of dynamic camera calibration considering moving objects in close range environments using straight lines as references is addressed. A mathematical model for the correspondence of a straight line in the object and image spaces is discussed. This model is based on the equivalence between the vector normal to the interpretation plane in the image space and the vector normal to the rotated interpretation plane in the object space. In order to solve the dynamic camera calibration, Kalman Filtering is applied; an iterative process based on the recursive property of the Kalman Filter is defined, using the sequentially estimated camera orientation parameters to feedback the feature extraction process in the image. For the dynamic case, e.g. an image sequence of a moving object, a state prediction and a covariance matrix for the next instant is obtained using the available estimates and the system model. Filtered state estimates can be computed from these predicted estimates using the Kalman Filtering approach and based on the system model parameters with good quality, for each instant of an image sequence. The proposed approach was tested with simulated and real data. Experiments with real data were carried out in a controlled environment, considering a sequence of images of a moving cube in a linear trajectory over a flat surface.

Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

A comparison of two nonlinear damping mechanisms in a vibration isolator

The vibration transmissibility characteristics of a single-degree-of- freedom (SDOF) passive vibration isolation system with different nonlinear dampers are investigated in this paper. In one configuration, the damper is assumed to be linear and viscous, and is connected to the mass so that it is perpendicular to the spring (horizontal damper). The vibration is in the direction of the spring. The second configuration is one in which the damper is in parallel with the spring but the damping force is proportional to the cube of the relative velocity across the damper (cubic damping). Both configurations are studied for small amplitudes of excitation, when some analysis can be conducted based on analytical expressions, and for large amplitudes of excitation, where the analysis is based on numerical simulations. It is found that the two nonlinear systems can outperform the linear system when force transmissibility is considered. However, for displacement transmissibility, the system with the horizontal damper exhibits some desirable properties, but the system with cubic damping does not. © 2012 Elsevier Ltd.

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

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)

Comportamento de milho (Zea Mays L.) e propriedades físicas do solo, no sistema plantio direto, em resposta a aplicação de fertilizante organomineral

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Desenvolvimento da grama esmeralda (Zoysia japonica Steud) sob dois manejos de irrigação

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)