Experimental study on polyester based concretes filled with glass fibre reinforced plastic recyclates – a contribution to composite materials sustainability

The development and applications of thermoset polymeric composites, namely fibre reinforced plastics (FRP), have shifted in the last decades more and more into the mass market [1]. Despite of all advantages associated to FRP based products, the increasing production and consume also lead to an increasing amount of FRP wastes, either end-of-lifecycle products, or scrap and by-products generated by the manufacturing process itself. Whereas thermoplastic FRPs can be easily recycled, by remelting and remoulding, recyclability of thermosetting FRPs constitutes a more difficult task due to cross-linked nature of resin matrix. To date, most of the thermoset based FRP waste is being incinerated or landfilled, leading to negative environmental impacts and supplementary added costs to FRP producers and suppliers. This actual framework is putting increasing pressure on the industry to address the options available for FRP waste management, being an important driver for applied research undertaken cost efficient recycling methods. [1-2]. In spite of this, research on recycling solutions for thermoset composites is still at an elementary stage. Thermal and/or chemical recycling processes, with partial fibre recovering, have been investigated mostly for carbon fibre reinforced plastics (CFRP) due to inherent value of carbon fibre reinforcement; whereas for glass fibre reinforced plastics (GFRP), mechanical recycling, by means of milling and grinding processes, has been considered a more viable recycling method [1-2]. Though, at the moment, few solutions in the reuse of mechanically-recycled GFRP composites into valueadded products are being explored. Aiming filling this gap, in this study, a new waste management solution for thermoset GFRP based products was assessed. The mechanical recycling approach, with reduction of GFRP waste to powdered and fibrous materials was applied, and the potential added value of obtained recyclates was experimentally investigated as raw material for polyester based mortars. The use of a cementless concrete as host material for GFRP recyclates, instead of a conventional Portland cement based concrete, presents an important asset in avoiding the eventual incompatibility problems arisen from alkalis silica reaction between glass fibres and cementious binder matrix. Additionally, due to hermetic nature of resin binder, polymer based concretes present greater ability for incorporating recycled waste products [3]. Under this scope, different GFRP waste admixed polymer mortar (PM) formulations were analyzed varying the size grading and content of GFRP powder and fibre mix waste. Added value of potential recycling solution was assessed by means of flexural and compressive loading capacities of modified mortars with regard to waste-free polymer mortars.

GFRP waste reinforced polymer mortars: a new waste management solution for GFRP scrap material

To date, glass fibre reinforced polymer (GFRP) waste recycling is very limited and restricted by thermoset nature of binder matrix and lack of economically viable enduse applications for the recyclates. In this study, efforts were made in order to recycle grinded GFRP waste proceeding from pultrusion production scrap, into new and sustainable composite materials. For this purpose, GFRP waste recyclates, a mix of powdered and fibrous materials, were incorporated into polyester based mortars as fine aggregate and filler replacements, at different load contents (between 4% up to 12% of total mass) and particle size distributions. Potential recycling solution was assessed by mechanical behaviour of resultant GFRP waste modified polymer mortars. Test results revealed that GFRP waste filled polymer mortars present improved flexural and compressive behaviour over unmodified polyester based mortars, thus indicating the feasibility of GFRP waste reuse in concrete-polymer composites.

PLSR Models for Mechanical Strengths of Concrete Composite Materials Reinforced with Pultrusion Wastes

In this paper, we present two Partial Least Squares Regression (PLSR) models for compressive and flexural strength responses of a concrete composite material reinforced with pultrusion wastes. The main objective is to characterize this cost-effective waste management solution for glass fiber reinforced polymer (GFRP) pultrusion wastes and end-of-life products that will lead, thereby, to a more sustainable composite materials industry. The experiments took into account formulations with the incorporation of three different weight contents of GFRP waste materials into polyester based mortars, as sand aggregate and filler replacements, two waste particle size grades and the incorporation of silane adhesion promoter into the polyester resin matrix in order to improve binder aggregates interfaces. The regression models were achieved for these data and two latent variables were identified as suitable, with a 95% confidence level. This technological option, for improving the quality of GFRP filled polymer mortars, is viable thus opening a door to selective recycling of GFRP waste and its use in the production of concrete-polymer based products. However, further and complementary studies will be necessary to confirm the technical and economic viability of the process.

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.

Radioactivity levels of 238U and 232Th decay series and related dose rates in the surroundings of a coal power plant using high resolution g-spectrometry

Gamma radiations measurements were carried out in the vicinity of a coal-fired power plant located in the southwest coastline of Portugal. Two different gamma detectors were used to assess the environmental radiation within a circular area of 20 km centred in the coal plant: a scintillometer (SPP2 NF, Saphymo) and a high purity germanium detector (HPGe, Canberra). Fifty urban and suburban measurements locations were established within the defined area and two measurements campaigns were carried out. The results of the total gamma radiation ranged from 20.83 to 98.33 counts per second (c.p.s.) for both measurement campaigns and outdoor doses rates ranged from 77.65 to 366.51 Gy/h. Natural emitting nuclides from the U-238 and Th-232 decay series were identified as well as the natural emitting nuclide K-40. The radionuclide concentration from the uranium and thorium series determined by gamma spectrometry ranged from 0.93 to 73.68 Bq/kg, while for K-40 the concentration ranged from 84.14 to 904.38 Bq/kg. The obtained results were used primarily to define the variability in measured environmental radiation and to determine the coal plant’s influence in the measured radiation levels. The highest values were measured at two locations near the power plant and at locations between the distance of 6 and 20 km away from the stacks, mainly in the prevailing wind direction. The results showed an increase or at least an influence from the coal-fired plant operations, both qualitatively and quantitatively.

Carbon nanotubes as reinforcement of cellulose liquid crystalline responsive networks

The incorporation of small amount of highly anisotropic nanoparticles into liquid crystalline hydroxypropylcellulose (LC-HPC) matrix improves its response when is exposed to humidity gradients due to an anisotropic increment of order in the structure. Dispersed nanoparticles give rise to faster order/disorder transitions when exposed to moisture as it is qualitatively observed and quantified by stress-time measurements. The presence of carbon nanotubes derives in a improvement of the mechanical properties of LC-HPC thin films.

Matrix converter as unified power flow controller: design and implementation of decoupled direct power controllers

This paper presents the design and implementation of direct power controllers for three-phase matrix converters (MC) operating as Unified Power Flow Controllers (UPFC). Theoretical principles of the decoupled linear power controllers of the MC-UPFC to minimize the cross-coupling between active and reactive power control are established. From the matrix converter based UPFC model with a modified Venturini high frequency PWM modulator, decoupled controllers for the transmission line active (P) and reactive (Q) power direct control are synthesized. Simulation results, obtained from Matlab/Simulink, are presented in order to confirm the proposed approach. Results obtained show decoupled power control, zero error tracking, and fast responses with no overshoot and no steady-state error.

On derivatives and norms of generalized matrix functions and respective symmetric powers

In recent papers, the authors obtained formulas for directional derivatives of all orders, of the immanant and of the m-th xi-symmetric tensor power of an operator and a matrix, when xi is a character of the full symmetric group. The operator norm of these derivatives was also calculated. In this paper, similar results are established for generalized matrix functions and for every symmetric tensor power.

Quimiotipagem do Cryptococcus neoformans. Revisão da literatura. Novos dados epidemiológicos sobre a criptococose. Nossa experiência com o emprego do meio de C.G.B. no estudo daquela levedura

O presente trabalho, além da revisão da literatura sobre quimiotipagem do C. neoformans, com novos dados sobre a epidemiologia da criptococose, teve por finalidade principal a caracterização das duas variedades desta levedura em pacientes com neurocriptococose, HIV + e HIV -. As variedades neoformans e gattii estão hoje bem definidas bioquimicamente, com o emprego do meio C.G.B., proposto por KWON-CHUNG et al. (1982) 24. O isolamento do C. neoformans var. gattii das flores e folhas do Eucalyptus camaldulensis e do Eucalyptus tereticornis, na Austrália, através dos trabalhos de ELLIS & PFEIFFER (1990)16 e PFEIFFER & ELLIS (1992)41, possibilitou investigações epidemiológicas das mais interessantes sobre este microrganismo, levedura capsulada a qual SANFELICE50, 51, na Itália, em 1894 e 1895 despertou a atenção do meio médico. BUSSE8, em 1894, descrevia o primeiro caso de criptococose humana sob a forma de lesão óssea, simulando sarcoma. As pesquisas nacionais sobre o assunto em foco foram destacadas, seguindo-se a experiência dos Autores com o meio de C.G.B. (L - canavanina, glicina e azul de bromotimol). Foi possível, através deste meio o estudo de 50 amostras de líquor, sendo 39 procedentes de aidéticos (78%) e 11 de não aidéticos (22%). De pacientes HIV+, 37 (74%) foram identificados como C. neoformans var. neoformans e 2 (4%) como C. neoformans var. gattii. Dos HIV- 8 ( 16%) foram classificados como C. neoformans var. neoformans e 3 (6%) como C. neoformans var. gattii. Através deste trabalho, evidencia-se a importância da neurocriptococose, principalmente entre os aidéticos, demonstrando-se mais uma vez o interesse do meio CGB na quimiotipagem do C. neoformans em suas duas variedades, ganhando em importância a demonstração de que duas espécies de eucalipto podem funcionar como "árvores-hospedeiras" para o Cryptococcus neoformans var. gattii.

Sparse matrix multiplication on a reconfigurable many-core architecture

Sparse matrix-vector multiplication (SMVM) is a fundamental operation in many scientific and engineering applications. In many cases sparse matrices have thousands of rows and columns where most of the entries are zero, while non-zero data is spread over the matrix. This sparsity of data locality reduces the effectiveness of data cache in general-purpose processors quite reducing their performance efficiency when compared to what is achieved with dense matrix multiplication. In this paper, we propose a parallel processing solution for SMVM in a many-core architecture. The architecture is tested with known benchmarks using a ZYNQ-7020 FPGA. The architecture is scalable in the number of core elements and limited only by the available memory bandwidth. It achieves performance efficiencies up to almost 70% and better performances than previous FPGA designs.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

Hyperspectral unmixing algorithm via dependent component analysis

This paper introduces a new method to blindly unmix hyperspectral data, termed dependent component analysis (DECA). This method decomposes a hyperspectral images into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA assumes that each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abudances are modeled as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. The effectiveness of the proposed method is illustrated using simulated data based on U.S.G.S. laboratory spectra and real hyperspectral data collected by the AVIRIS sensor over Cuprite, Nevada.

Comparison of Disposable Pipette Extraction and Dispersive Solid-Phase Extraction in the QuEChERS Method for Analysis of Pesticides in Strawberries

In this study, we sought to assess the applicability of GC–MS/MS for the identification and quantification of 36 pesticides in strawberry from integrated pest management (IPM) and organic farming (OF). Citrate versions of QuEChERS (quick, easy, cheap, effective, rugged and safe) using dispersive solid-phase extraction (d-SPE) and disposable pipette extraction (DPX) for cleanup were compared for pesticide extraction. For cleanup, a combination of MgSO4, primary secondary amine and C18 was used for both the versions. Significant differences were observed in recovery results between the two sample preparation versions (DPX and d-SPE). Overall, 86% of the pesticides achieved recoveries (three spiking levels 10, 50 and 200 µg/kg) in the range of 70–120%, with <13% RSD. The matrix effects were also evaluated in both the versions and in strawberries from different crop types. Although not evidencing significant differences between the two methodologies were observed, however, the DPX cleanup proved to be a faster technique and easy to execute. The results indicate that QuEChERS with d-SPE and DPX and GC–MS/MS analysis achieved reliable quantification and identification of 36 pesticide residues in strawberries from OF and IPM.

Hepatitis G virus / GB virus C in Brazil. Preliminary report

Hepatitis G virus/ GB virus C is a novel flavivirus recently detected in hepatitis non A-E cases. In this study, the presence of this virus in chronic non-B, non-C hepatitis patients was evaluated using GBV-C specific PCR and this virus was detected in one out of thirteen patients. This patient has presented a severe liver failure, has lived for a long time in the Western Amazon basin and no other cause for this clinical picture was reported. The impact of the discovery of this new agent is still under evaluation throughout the world. The study of the prevalence of this virus among chronic hepatitis patients and healthy individuals (as blood donors) will furnish subside to evaluate its real pathogenicity.

GB virus C/Hepatitis G virus and other putative hepatitis non A-E viruses

The identification of the major agents causing human hepatitis (Hepatitis A, B, C, D and E Viruses) was achieved during the last 30 years. These viruses are responsible for the vast majority of human viral hepatitis cases, but there are still some cases epidemiologically related to infectious agents without any evidence of infection with known virus, designated as hepatitis non A - E. Those cases are considered to be associated with at least three different viruses: 1 - Hepatitis B Virus mutants expressing its surface antigen (HBsAg) with altered epitopes or in low quantities; 2 - Another virus probably associated with enteral transmitted non A-E hepatitis, called Hepatitis F Virus. Still more studies are necessary to better characterize this agent; 3 - Hepatitis G Virus or GB virus C, recently identified throughout the world (including Brazil) as a Flavivirus responsible for about 10% of parenteral transmitted hepatitis non A-E. Probably still other unknown viruses are responsible for human hepatitis cases without evidence of infection by any of these viruses, that could be called as non A-G hepatitis.