Temperature Oscillation Calorimetry: Robustness analysis of different algorithms for the evaluation of the heat transfer coefficient

Applicability of different temperature oscillation calorimetry algorithms, previously proposed in the literature, for the evaluation of the heat transfer coefficient during the course of the reaction, is analysed by referring to the experimental data from a methyl methacrylate polymerisation reactor.Results are coincident in the nominal case (no errors on data), while differences appear in the elaboration of real data. The effect of uncertainty in the experimental data has been simulated in terms of error on the amplitude and on the phase of reactor and jacket temperature profiles.This approach allows to indicate algorithms having the best robustness properties and to give an explanation of phase errors in terms of a lumped parameter which accounts for different phenomena, not included in the basic hypotheses of the method. Based on this observation, a procedure to eliminate this source of errors from experimental data is proposed for the more general algorithm presented to handle oscillating temperature profiles generated by different techniques.     

Obituaries: Elizabeth Douvan (1926-2002).

Presents an obituary for Elizabeth Douvan (1926-2002). Douvan was a pioneer in the study of changing gender, work, and family roles; personal values; and well-being in the second half of the 20th century. Through her research, she contributed to the interdisciplinary fields of social psychology and women's studies while building and strengthening institutions that remain committed to the same mission. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Web‐based Open‐source Geoinformation Tool for Regional Water Resources Assessment

Water Resources Management - To reduce the impact of droughts and increase the resilience of regional water systems, various competing demands, such as hydropower, supply, irrigation and river...     

THROO: a Tracked Hybrid Rover to Overpass Obstacles

In this paper, the design, simulation and experimental tests are presented for THROO: a Tracked Hybrid Rover, which has been developed to Overpass Obstacles. The proposed mobile robot has 3-DOFs and it is capable of straight motion, turning ability and two operations, namely rover-like motion with tracks on flat terrain and walking-like motion with track and legs to overpass obstacles to move on uneven terrain. The leg mechanism is composed of a four-bar linkage, which has been synthesized according to the desired features. In particular, the Burmester problem, which aims at finding the geometric parameters of a four-bar linkage required for a prescribed set of finitely separated poses are solved for the case understudy. Dynamic simulations have been carried out and a prototype has been built. The proposed results show the hybrid rover ability to overpass obstacles, for which size is comparable or greater than the track high.     

Feeding response of Ips paraconfusus to phloem and phloem metabolites of Heterobasidion annosum-inoculated ponderosa pine,Pinus ponderosa

In studies of feeding by the bark beetle, Ips paraconfusus, two pine stilbenes (pinosylvin and pinosylvin methyl ether), ferulic acid glucoside, and enantiomers of the four most common sugars present in ponderosa pine phloem (sucrose, glucose, fructose, and raffinose) did not stimulate or reduce male feeding when assayed on wet -cellulose with or without stimulatory phloem extractives present. When allowed to feed on wet -cellulose containing sequential extracts (hexane, methanol, and water) of ponderosa pine phloem, methanol and water extractives stimulated feeding, but hexane extractives did not. Males confined in wet -cellulose containing aqueous or organic extracts of culture broths derived from phloem tissue and containing the root pathogen, Heterobasidion annosum, ingested less substrate than beetles confined to control preparations. In an assay using logs from uninoculated ponderosa pines, the mean lengths of phloem in the digestive tracts increased as time spent feeding increased. Males confined to the phloem of basal logs cut from ponderosa pines artificially inoculated with H. annosum ingested significantly less phloem than beetles in logs cut from trees that were (combined) mock-inoculated or uninoculated and did not contain the pathogen. However, individual pathogen-containing treatments were not significantly different from uninoculated controls. It was concluded that altered feeding rates are not a major factor which may explain why diseased ponderosa pines are colonized by I. paraconfusus.     

Thermal and flammability properties of a silica–poly(methylmethacrylate) nanocomposite

PMMA, poly(metheylmethacrylate), nanocomposites were made by in situ radical polymerization of MMA, methylmethacrylate, with colloidal silica (ca. 12 nm) to study the effects of nanoscale silica particles on the physical properties and flammability properties of PMMA. Transparent samples resulted and the dispersity of the particles was examined by transmission electron microscopy and atomic force microscopy. The addition of nanosilica particles (13% by mass) did not significantly change the thermal stability, but it made a small improvement in modulus, and it reduced the peak heat release rate roughly 50%. Last, the flame‐retardant mechanism provided by the addition of nanosilica particles in PMMA is discussed. Published 2003 Wiley Periodicals, Inc. J Appl Polym Sci 89: 2072–2078, 2003     

On sets of numbers accepted by P/T systems composed by join

Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow.Here we continue this line of research by introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only by join. Moreover, we study how J languages relate to other families of formal languages.     

Minimum-delay schedules in layered networks

Summary In this paper, we consider the following problem: given a layered network including a set of messages, each of which must be transmitted from a source to a sink node, what is the sequence of moves from one node to another which minimizes the total completion time? We first show that the general problem is NP-complete for both fixed and variable path routing (thus the scheduling problem for more realistic networks with cycles must be considered computationally intractable). We then consider several restrictions which admit polynomia time algorithms.Most of this work was done while this author was at the Department of Mathematics, University of Rome La Sapienza