Physical and thermal strain of firefighters according to the firefighting tactics used to suppress wildfires

The aim of this study was to analyse the physiological strain of firefighters, using heart rate (HR) and core temperature, during real wildfire suppression according to the type of attack performed (direct, indirect or mixed). Three intensity zones were established according to the HR corresponding to the ventilatory threshold (VT) and respiratory compensation threshold (RCT): zone 1, RCT. The exercise workload (training impulse (TRIMP)), the physiological strain index (PSI) and the cumulative heat strain index(CHSI) were calculated using the time spent in each zone, and the HR and core temperature, respectively. Significantly higher mean HR, time spent in Z2 and Z3 and TRIMP h(-1) were found in direct and mixed versus indirect attacks. The highest PSI and CHSI were observed in the direct attack. In conclusion, exercise strain and combined thermal strain, but not core temperature during wildfire suppression, are related to the type of attack performed. STATEMENT OF RELEVANCE: Our findings demonstrated that wildfire firefighting is associated with high physiological demands, which vary significantly depending on the tactics chosen for performing the task. These results should be kept in mind when planning programmes to improve wildland firefighters' physical fitness, which will allow improvement in their performance.     

Fracture analysis of plane piezoelectric/piezomagnetic multiphase composites under transient loading

The transient response of cracked composite materials made of piezoelectric and piezomagnetic phases, when subjected to in-plane magneto-electro-mechanical dynamic loads, is addressed in this paper by means of a mixed boundary element method (BEM) approach. Both the displacement and traction boundary integral equations (BIEs) are used to develop a single-domain formulation. The convolution integrals arising in the time-domain BEM are numerically computed by Lubich’s quadrature, which determines the integration weights from the Laplace transformed fundamental solution and a linear multistep method. The required Laplace-domain fundamental solution is derived by means of the Radon transform in the form of line integrals over a unit circumference. The singular and hypersingular BIEs are numerically evaluated in a precise and efficient manner by a regularization procedure based on a simple change of variable, as previously proposed by the authors for statics. Discontinuous quarter-point elements are used to properly capture the behavior of the extended crack opening displacements (ECOD) around the crack-tip and directly evaluate the field intensity factors (stress, electric displacement and magnetic induction intensity factors) from the computed nodal data. Numerical results are obtained to validate the formulation and illustrate its capabilities. The effect of the combined application of electric, magnetic and mechanical loads on the dynamic field intensity factors is analyzed in detail for several crack configurations under impact loading.     

Augmenting the Rigidity of a Graph in <Emphasis Type="Italic">R</Emphasis><Superscript>2</Superscript>

Given a Laman graph G, i.e. a minimally rigid graph in R ², we provide a Θ(n ²) algorithm to augment G to a redundantly rigid graph, by adding a minimum number of edges. Moreover, we prove that this problem of augmenting is NP-hard for an arbitrary rigid graph G in R ².     

Applying intelligent agents and semantic web services in eGovernment environments

The increasing volume of eGovernment‐related services is demanding new approaches for service integration and interoperability in this domain. Semantic web (SW) technologies and applications can leverage the potential of eGovernment service integration and discovery, thus tackling the problems of semantic heterogeneity characterizing eGovernment information sources and the different levels of interoperability. eGovernment services will therefore be semantically described in the foreseeable future. In an environment with semantically annotated services, software agents are essential as the entities responsible for exploiting the semantic content in order to automate some tasks, and so enhance the user's experience. In this paper, we present a framework that provides a seamless integration of semantic web services and intelligent agents technologies by making use of ontologies to facilitate their interoperation. The proposed framework can assist in the development of powerful and flexible distributed systems in complex, dynamic, heterogeneous, unpredictable and open environments. Our approach is backed up by a proof‐of‐concept implementation, where the breakthrough of integrating disparate eGovernment services has been tested.     

An Efficient Solution for Model Checking Graph Transformation Systems

This paper presents an efficient solution for modeling checking graph transformation systems. The approach transforms AGG specifications into Bogor models and supports both attributed typed graphs and layered transformations. Resulting models are amenable to check interesting properties expressed as combinations of LTL (Linear Temporal Logic) and graph transformation rules. The first experimental results are encouraging and show that in most cases our proposal improves existing approaches, both in terms of performance and expressiveness.     

Guidelines for the incremental identification of aspects in requirements specifications

The desired principle of separation of concerns in software development can be jeopardized by the so-called crosscutting concerns, which tend to be scattered over (and tangled with) the functionality of the modular units of a system. The correct identification of such concerns (and their encapsulation into separate artifacts) is thereby considered a way to improve software understanding and evolution. Pursuing a proper management of concerns from the requirements engineering stage can greatly benefit the entire software life-cycle. In this paper, we propose conceptual guidelines on how to perform the identification of crosscutting concerns in the process of building requirements specifications. We argue that the identification must be carried out in an incremental way, to encapsulate apart the crosscutting concerns even if they have not emerged completely yet.

Segmentation of cervical cell nuclei in high-resolution microscopic images: A new algorithm and a web-based software framework

In order to automate cervical cancer screening tests, one of the most important and longstanding challenges is the segmentation of cell nuclei in the stained specimens. Though nuclei of isolated cells in high-quality acquisitions often are easy to segment, the problem lies in the segmentation of large numbers of nuclei with various characteristics under differing acquisition conditions in high-resolution scans of the complete microscope slides. We implemented a system that enables processing of full resolution images, and proposes a new algorithm for segmenting the nuclei under adequate control of the expert user. The system can work automatically or interactively guided, to allow for segmentation within the whole range of slide and image characteristics. It facilitates data storage and interaction of technical and medical experts, especially with its web-based architecture. The proposed algorithm localizes cell nuclei using a voting scheme and prior knowledge, before it determines the exact shape of the nuclei by means of an elastic segmentation algorithm. After noise removal with a mean-shift and a median filtering takes place, edges are extracted with a Canny edge detection algorithm. Motivated by the observation that cell nuclei are surrounded by cytoplasm and their shape is roughly elliptical, edges adjacent to the background are removed. A randomized Hough transform for ellipses finds candidate nuclei, which are then processed by a level set algorithm. The algorithm is tested and compared to other algorithms on a database containing 207 images acquired from two different microscope slides, with promising results.