Three-phase four-wire circuits interpretation by means of different power theories

In order to contribute to the discussion of defining a generalized power theory, valid for unbalanced and non linear circuits, this paper discusses the relationship and discrepancies among four modern power theories. Three-phase four-wire circuits, under different conditions, have been analyzed, since the most conflicting and intriguing interpretations take place in case of return conductor occurrence. Simulation results of different load, power supply and line conditions will be discussed in order to elucidate the author's conclusions and to provoke the readers for additional discussions. © 2010 IEEE.

Qualidade fisiológica de sementes de diferentes árvores matrizes de Corymbia citriodora (Hook.) K.D.Hill & L.A.S. Johnson

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

Semiautomatic dental recognition using a graph-based segmentation algorithm and teeth shapes features

Dental recognition is very important for forensic human identification, mainly regarding the mass disasters, which have frequently happened due to tsunamis, airplanes crashes, etc. Algorithms for automatic, precise, and robust teeth segmentation from radiograph images are crucial for dental recognition. In this work we propose the use of a graph-based algorithm to extract the teeth contours from panoramic dental radiographs that are used as dental features. In order to assess our proposal, we have carried out experiments using a database of 1126 tooth images, obtained from 40 panoramic dental radiograph images from 20 individuals. The results of the graph-based algorithm was qualitatively assessed by a human expert who reported excellent scores. For dental recognition we propose the use of the teeth shapes as biometric features, by the means of BAS (Bean Angle Statistics) and Shape Context descriptors. The BAS descriptors showed, on the same database, a better performance (EER 14%) than the Shape Context (EER 20%). © 2012 IEEE.

BBA: A binary bat algorithm for feature selection

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the bats behaviour, which has never been applied to this context so far. The wrapper approach combines the power of exploration of the bats together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in five public datasets have demonstrated that the proposed approach can outperform some well-known swarm-based techniques. © 2012 IEEE.

Caracterização dielétrica de partículas nanométricas e nanoestruturadas de óxido de niobato da família tetragonal tungstênio bronze com estequiometria K'Sr IND. 2' N'b IND. 5' 'O IND. 15'

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

Programa computacional para análise do faturamento do consumo de energia elétrica através do k-hiperbolóide de carga e potência em empresas frigoríficas abatedoras de bovinos

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Análise de crescimento, curva de absorção de macronutrientes (N, P e K) e teor de beta- ecdisona em fáfia (Pfaffia glomerata (Spreng). Pedersen em função de adubação orgânica

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

Sedenions Cayley-dickson e dilatação de funções k-quaseconformes

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

An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

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

Cognição Numérica de crianças pré-escolares brasileiras pela ZAREKI-K

The Numerical Cognition is infl uenced by biological, cognitive, educational and cultural factors. It consists of a primary system, called Number Sense that would be innate and universal, also of secondary systems: the Calculation, implied to perform mathematical operations by means of symbols or words and Number Processing, which is divided into two components, Number Comprehension, related with the understanding of numerical symbols and Number Production, which includes reading, writing and coun-ting numbers. However, studies that show the development of these functions in children of preschool age are scarce. Therefore, aims of this study were to investigate numerical cognition in preschool Brazilian children to demonstrate the construct validity of the ZAREKI-K (A Neuropsychological Battery for the Assessment of Treatment of Numbers and Calculation for preschool children). The participants were 42 children of both genders, who attended public elementary schools; the children were evaluated by this battery and WISC-III. The results indicated signifi cant differences associated with age which children of 6 years had better scores on subtests related to Number Production, Calculation and Number Comprehension, as well moderate and high correlations between some subtests of both instruments, demonstrating the construct validity of the battery. In conclusion, preliminary normative data were obtained for ZAREKI-K. The analyses suggested that it is a promising tool for the assessment of numerical cognition in preschool children.Keywords: Mathematics, number, preschoolers, working memory, Developmental Dyscalculia.

Kinetic Analysis of Gill (Na+,K+)-ATPase Activity in Selected Ontogenetic Stages of the Amazon River Shrimp, (Decapoda, Palaemonidae): Interactions at ATP- and Cation-Binding Sites

We investigated modulation by ATP, Mg2+, Na+, K+ and NH4 (+) and inhibition by ouabain of (Na+,K+)-ATPase activity in microsomal homogenates of whole zoeae I and decapodid III (formerly zoea IX) and whole-body and gill homogenates of juvenile and adult Amazon River shrimps, . (Na+,K+)-ATPase-specific activity was increased twofold in decapodid III compared to zoea I, juveniles and adults, suggesting an important role in this ontogenetic stage. The apparent affinity for ATP ( (M) = 0.09 +/- A 0.01 mmol L-1) of the decapodid III (Na+,K+)-ATPase, about twofold greater than the other stages, further highlights this relevance. Modulation of (Na+,K+)-ATPase activity by K+ also revealed a threefold greater affinity for K+ ( (0.5) = 0.91 +/- A 0.04 mmol L-1) in decapodid III than in other stages; NH4 (+) had no modulatory effect. The affinity for Na+ ( (0.5) = 13.2 +/- A 0.6 mmol L-1) of zoea I (Na+,K+)-ATPase was fourfold less than other stages. Modulation by Na+, Mg2+ and NH4 (+) obeyed cooperative kinetics, while K+ modulation exhibited Michaelis-Menten behavior. Rates of maximal Mg2+ stimulation of ouabain-insensitive ATPase activity differed in each ontogenetic stage, suggesting that Mg2+-stimulated ATPases other than (Na+,K+)-ATPase are present. Ouabain inhibition suggests that, among the various ATPase activities present in the different stages, Na+-ATPase may be involved in the ontogeny of osmoregulation in larval The NH4 (+)-stimulated, ouabain-insensitive ATPase activity seen in zoea I and decapodid III may reflect a stage-specific means of ammonia excretion since functional gills are absent in the early larval stages.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Unraveling the Mysterious Role of Palladium in Feigl bis(dimethylglyoximate)nickel(II) Spot Tests by Means of Confocal Raman Microscopy

The add protection effect promoted by traces of PdCl2 in [Ni(dmgH)(2)] spot tests was elucidated from confocal Raman microscopy imaging, which revealed the formation of protecting layers of [Pd(dmgH)(2)] closing the extremities of the [Ni(dmgH)(2)] filaments.

Looking over Toxin-K+ Channel Interactions. Clues from the Structural and Functional Characterization of alpha-KTx Toxin Tc32, a Kv1.3 Channel Blocker

alpha-KTx toxin Tc32, from the Amazonian scorpion Tityus cambridgei, lacks the dyad motif; including Lys27, characteristic of the family and generally associated with channel blockage. The toxin has been cloned and expressed for the first time. Electrophysiological experiments, by showing that the recombinant form blocks Kv1.3 channels of olfactory bulb periglomerular cells like the natural Tc32 toxin, when tested on the Kv1.3 channel of human T lymphocytes, confirmed it is in an active fold. The nuclear magnetic resonance-derived structure revealed it exhibits an alpha/beta scaffold typical of the members of the alpha-KTx family. TdK2 and TdK3, all belonging to the same alpha-KTx 18 subfamily, share significant sequence identity with Tc32 but diverse selectivity and affinity for Kv1.3 and Kv1.1 channels. To gain insight into the structural features that may justify those differences, we used the recombinant Tc32 nuclear magnetic resonance-derived structure to model the other two toxins, for which no experimental structure is available. Their interaction with Kv1.3 and Kv1.1 has been investigated by means of docking simulations. The results suggest that differences in the electrostatic features of the toxins and channels, in their contact surfaces, and in their total dipole moment orientations govern the affinity and selectivity of toxins. In addition, we found that, regardless of whether the dyad motif is present, it is always a Lys side chain that physically blocks the channels, irrespective of its position in the toxin sequence.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm