A multiwinding modeling method for high frequency transformers and inductors

This paper presents a method to obtain an electric model for transformers and inductors, including both frequency and geometry effects in the windings, which can be linked with existing core models. One-dimensional distributions for magnetic and electric fields are assumed, and from Maxwell's equations an equivalent electric circuit is easily obtained. This equivalent circuit has been included in analog simulators (Spice, AnalogWorkBench, Saber ...), and comparisons between measured and simulated results are shown, both in time domain and in AC sweep, which verify the model accuracy. The model described in this paper allows designers to deal with key issues in the design of high-frequency magnetic components (copper losses, leakage inductance, skin and proximity effects) by using analog simulators, which are usually more familiar to them than finite-element analysis tools.     

Nodal sensitivities as error estimates in computational mechanics

Summary This paper proposes the use of special sensitivities, called nodal sensitivities, as error indicators and estimators for numerical analysis in mechanics. Nodal sensitivities are defined as rates of change of response quantities with respect to nodal positions. Direct analytical differentiation is used to obtain the sensitivities, and the infinitesimal perturbations of the nodes are forced to lie along the elements. The idea proposed here can be used in conjunction with general purpose computational methods such as the Finite Element Method (FEM), the Boundary Element Method (BEM) or the Finite Difference Method (FDM); however, the BEM is the method of choice in this paper. The performance of the error indicators is evaluated through two numerical examples in linear elasticity.     

Nephelometric study of salivary protein–tannin aggregates

Grape seed procyanidins were fractionated through different degrees of polymerisation, and human saliva was purified and separated into two fractions: one was mostly α‐amylase and the other was essentially proline‐rich proteins (PRPs). The interaction of these proteins with the procyanidin compounds was assayed using nephelometry, and the influence of several factors was investigated, such as degree of polymerisation, pH and concentrations of both protein and tannin. The same experiments were performed with bovine serum albumin (BSA). The amount of insoluble aggregates, resulting from the formation of polyphenol–protein aggregates, increased quickly up to a maximum value which thereafter remained practically unchanged. pH was set at 5.0 for all further assays, since it was the nearest value to that encountered in human saliva (pH 5.6–7.9), where proteins were stable and had a maximum ability to bind and precipitate procyanidin oligomers. These proteins were shown to have a strong affinity for procyanidin oligomers and were unable to resolubilise the polyphenol–protein aggregates when present in excess. PRPs required a much lower content to bind all the tannins (400 µg of procyanidin oligomers) than BSA and especially α‐amylase (48, 60 and 132 µg respectively). The procyanidin's ability to bind PRPs, BSA and α‐amylase increased with its average molecular weight. This ability increased regularly for PRPs up to 4500 Da, whereas the ability to bind the globular proteins decreased beyond 3400 Da. © 2001 Society of Chemical Industry     

Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm

A Finite Element Graph (FEG) is defined here as a nodal graph (G), a dual graph (G*), or a communication graph (G˙) associated with a generic finite element mesh. The Laplacian matrix ( L (G), L (G*) or L (G˙)), used for the study of spectral properties of an FEG, is constructed from usual vertex and edge connectivities of a graph. An automatic algorithm, based on spectral properties of an FEG (G, G* or G˙), is proposed to reorder the nodes and/or elements of the associated finite element mesh. The new algorithm is called Spectral PEG Resequencing (SFR). This algorithm uses global information in the graph, it does not depend on a pseudoperipheral vertex in the resequencing process, and it does not use any kind of level structure of the graph. Moreover, the SFR algorithm is of special advantage in computing environments with vector and parallel processing capabilities. Nodes or elements in the mesh can be reordered depending on the use of an adequate graph representation associated with the mesh. If G is used, then the nodes in the mesh are properly reordered for achieving profile and wavefront reduction of the finite element stiffness matrix. If either G* or G˙ is used, then the elements in the mesh are suitably reordered for a finite element frontai solver, A unified approach involving FEGs and finite element concepts is presented. Conclusions are inferred and possible extensions of this research are pointed out. In Part II of this work,¹ the computational implementation of the SFR algorithm is described and several numerical examples are presented. The examples emphasize important theoretical, numerical and practical aspects of the new resequencing method.     

T-stress in orthotropic functionally graded materials: Lekhnitskii and Stroh formalisms

A new interaction integral formulation is developed for evaluating the elastic T-stress for mixed-mode crack problems with arbitrarily oriented straight or curved cracks in orthotropic nonhomogeneous materials. The development includes both the Lekhnitskii and Stroh formalisms. The former is physical and relatively simple, and the latter is mathematically elegant. The gradation of orthotropic material properties is integrated into the element stiffness matrix using a “generalized isoparametric formulation” and (special) graded elements. The specific types of material gradation considered include exponential and hyperbolic-tangent functions, but micromechanics models can also be considered within the scope of the present formulation. This paper investigates several fracture problems to validate the proposed method and also provides numerical solutions, which can be used as benchmark results (e.g. investigation of fracture specimens). The accuracy of results is verified by comparison with analytical solutions.     

Fabry Disease and the Heart: A Comprehensive Review

Fabry disease (FD) is an X-linked lysosomal storage disorder caused by mutations of the GLA gene that result in a deficiency of the enzymatic activity of α-galactosidase A and consequent accumulation of glycosphingolipids in body fluids and lysosomes of the cells throughout the body. GB3 accumulation occurs in virtually all cardiac cells (cardiomyocytes, conduction system cells, fibroblasts, and endothelial and smooth muscle vascular cells), ultimately leading to ventricular hypertrophy and fibrosis, heart failure, valve disease, angina, dysrhythmias, cardiac conduction abnormalities, and sudden death. Despite available therapies and supportive treatment, cardiac involvement carries a major prognostic impact, representing the main cause of death in FD. In the last years, knowledge has substantially evolved on the pathophysiological mechanisms leading to cardiac damage, the natural history of cardiac manifestations, the late-onset phenotypes with predominant cardiac involvement, the early markers of cardiac damage, the role of multimodality cardiac imaging on the diagnosis, management and follow-up of Fabry patients, and the cardiac efficacy of available therapies. Herein, we provide a comprehensive and integrated review on the cardiac involvement of FD, at the pathophysiological, anatomopathological, laboratory, imaging, and clinical levels, as well as on the diagnosis and management of cardiac manifestations, their supportive treatment, and the cardiac efficacy of specific therapies, such as enzyme replacement therapy and migalastat.     

Superabsorbent hydrogel based on modified polysaccharide for removal of Pb2+ and Cu2+ from water with excellent performance

This contribution describes the absorption percentage of Pb²⁺ and Cu²⁺ from water by a superabsorbent hydrogel matrix (SH) made from an anionic polysaccharide copolymerized with acrylic acid (AAc) and acrylamide (AAm). Metal‐absorption tests, upon sequential pH variation, indicated that the SH has pH‐sensitivity for the absorption of both metals from solution, attributed to the functional ionic groups (? COOH) present in the AAc and arabic gum (AG) segments. At the pH 5.0, the SH exhibited good absorption capacity: 73.10% for Pb²⁺, 81.99% for Cu²⁺ in water and 63.64% for Pb²⁺, and 76.67% for Cu²⁺ in saline water with 0.1 mol kg^?1 ionic strength. A replicated 2² full factorial design with a central point was built to evaluate the maximum absorption capacity of the metals into the SH. It was found that both the interaction and main effects of the pH and the initial concentration of metal solution on absorption percentage of the metals were statistically significant. Surface response plots indicated that the absorption capacity of both metals into the SH may be appreciably improved by using the solutions with lower initial concentration of metal and with higher pH values. Metal‐absorption results demonstrated that the SH is a convenient material for absorption of Pb²⁺ and Cu²⁺ from pure aqueous and saline aqueous environments. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 2007     

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.