Characteristics investigation on heat transfer growth of sonochemically synthesized ZnO-DW based nanofluids inside square heat exchanger

Journal of Thermal Analysis and Calorimetry - In recent decades, the growth of heat transfer using nanomaterials in the conventional base fluid has caught the attention of researchers...     

A volatolomic approach using cerumen as biofluid to diagnose bovine intoxication by Stryphnodendron rotundifolium

An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication.     

Economics and Performance of 10 Gb/s Metro Transport Over Mixed Fiber Plant of G.655 NZDF and G.652.C Zero Water-Peak Fibers

Using lower-cost lasers, 30% savings are possible for 10-Gb/s uncompensated metro transmission over NZDF, compared to G.652 fiber. We present WDM transmission results for a mixed plant of NZDF rings interconnected to G.652.C-fiber access laterals.     

Recent Advances of Multi-Channel Transmission in Metro Access Networks

We discuss the concept of coarse wavelength-division multiplexing (CWDM) for metro networks. After reviewing the requirements on components such as lasers and fiber, we propose different architectures for a flexible upgrade of existing CWDM systems.     

The effect of rapid rotation on a vertical bridgman furnace at large Rayleigh number

In quasi-steady operation, convection currents in a Bridgmandevice, used for producing a semi-conductor crystal, createinhomogeneities that may make the crystal unusable. It has oftenbeen suggested that additional forces due to rotation or magnetismmight be efficacious in reducing the segregation of the elementsof the alloy. It has been found that, over a wide range of rotationrates, there is no improvement in performance due to rotationabout the vertical axis. However, numerical results that havebeen obtained previously (Lee & Pearlstein, J. Crys. Growth240, 2002) indicate that, when effects of centrifugal buoyancyare introduced, a substantial reduction in segregation is achieved.In the work reported here, by contrast, in which we extend previouslarge-Rayleigh-number asymptotic analysis to include centrifugalbuoyancy, we find no improvement in radial segregation, butrather increasing segregation with increasing rotation rate.     

Using a Conic Formulation for Finding Steiner Minimal Trees

We present a new mathematical programming formulation for the Steiner minimal tree problem. We relax the integrality constraints on this formulation and transform the resulting problem (which is convex, but not everywhere differentiable) into a standard convex programming problem in conic form. We consider an efficient computation of an ε-optimal solution for this latter problem using an interior-point algorithm.