Transmembrane passage of cytokine-inducing bacterial products across new and reprocessed polysulfone dialyzers

The widespread use of bicarbonate dialysate and reprocessed high-efficiency and "high-flux" dialyzers has raised concerns about the increased risk of reverse-transfer of dialysate contaminants into the blood compartment. To evaluate this concern, the reverse-transfer of bacterial products from contaminated bicarbonate dialysate into the blood compartment was compared during in vitro dialysis with new or reprocessed high-flux polysulfone dialyzers. In vitro dialysis was carried out at 37 degrees C by use of a counter-current recirculating loop dialysis circuit with either new high-flux polysulfone dialyzers or dialyzers reprocessed once or 20 times with formaldehyde (0.75%) and bleach (< 1%) with an automated system. Heparinized whole blood from healthy volunteers was circulated through the blood compartment, and bicarbonate dialysate was circulated in the dialysate compartment. The dialysate was challenged sequentially by 1:1000 and 1:100 dilutions of a sterile Pseudomonas aeruginosa culture supernatant (bacterial challenge). Samples were drawn from the blood and dialysate compartments 1 h after each challenge. Peripheral blood mononuclear cells (PBMC) were harvested by Ficoll-Hypaque separation from whole blood in the blood compartment and a 5 x 10(6) PBMC/mL cell suspension was prepared. Likewise, dialysate samples (0.5 mL) were added to 0.5 mL suspension of 5 x 10(6) PBMC/mL drawn at baseline. All PBMC suspensions were incubated upright in a humidified atmosphere at 37 degrees C with 5% CO2 for 24 h, and total interleukin-1 alpha (IL-1 alpha) and tumor necrosis factor-alpha (TNF alpha) cytokine production (cell-associated and secreted) was measured by radioimmunoassay. Eight experiments were performed for each arm of the study with the same donor for each arm. One hour after contaminating the dialysate with a 1:1000 dilution of the bacterial challenge, IL-1 alpha production by PBMC harvested from the blood compartment was 160 +/- 0, 171 +/- 11, and 270 +/- 35 pg, respectively, for new dialyzers, dialyzers reprocessed once, and dialyzers reprocessed 20 times (P = 0.004). One hour after challenging the dialysate with 1:100 dilution, IL-1 alpha production by PBMC harvested from the blood compartment was 188 +/- 20, 228 +/- 35, and 427 +/- 67 pg, respectively, for new dialyzers, dialyzers reprocessed once, and dialyzers reprocessed 20 times (P = 0.006). IL-1 alpha production by PBMC from dialyzers reprocessed 20 times was significantly greater than both new and dialyzers reprocessed once. However, there were no significant differences between new dialyzers and dialyzers reprocessed once. Similarly, after the 1:1000 challenge, TNF alpha production by PBMC harvested from the blood compartment was 160 +/- 0, 160 +/- 0, and 213 +/- 22 pg, respectively, for new dialyzers, dialyzers reprocessed once, and dialyzers reprocessed 20 times (P = 0.008). After the 1:100 challenge, TNF alpha production was 168 +/- 8, 188 +/- 20, and 225 +/- 32 pg, respectively, for new dialyzers, dialyzers reprocessed once, and dialyzers reprocessed 20 times (P = 0.20). These results demonstrate that reprocessing of high-flux polysulfone dialyzers with bleach increases the risk of reverse-transfer of bacterial products from contaminated dialysate, and this risk appears to increase with the number of reuses. Consequently, units that reprocess membranes with bleach and have suboptimal water quality might subject their patients to a higher risk of cytokine-related morbidity.     

Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation

Many applications (such as system and user monitoring, runtime verification, diagnosis, observation-based decision making, intention recognition) all require to detect the occurrence of an event in a system, which entails the ability to observe the system. Observation can be costly, so it makes sense to try and reduce the number of observations, without losing full certainty about the event??s actual occurrence. In this paper, we propose a formalization of this problem. We formally show that, whenever the event to be detected follows a discrete spatial or temporal pattern, then it is possible to reduce the number of observations. We discuss exact and approximate algorithms to solve the problem, and provide an experimental evaluation of them. We apply the resulting algorithms to verification of linear temporal logics formulæ. Finally, we discuss possible generalizations and extensions, and, in particular, how event detection can benefit from logic programming techniques.     

Post-processing and visualization techniques in 2D boundary element analysis

Most post-processors for boundary element (BE) analysis use an auxiliary domain mesh to display domain results, working against the profitable modelling process of a pure boundary discretization. This paper introduces a novel visualization technique which preserves the basic properties of the boundary element methods. The proposed algorithm does not require any domain discretization and is based on the direct and automatic identification of isolines. Another critical aspect of the visualization of domain results in BE analysis is the effort required to evaluate results in interior points. In order to tackle this issue, the present article also provides a comparison between the performance of two different BE formulations (conventional and hybrid). In addition, this paper presents an overview of the most common post-processing and visualization techniques in BE analysis, such as the classical algorithms of scan line and the interpolation over a domain discretization. The results presented herein show that the proposed algorithm offers a very high performance compared with other visualization procedures.     

Tree pattern mining with tree automata constraints

Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process.     

A methodology for the generation of planar models for multibody chain drives

To overcome the difficulty on building manually complex models of chain drives, this work proposes a comprehensive methodology to build multibody models of any general chain drive automatically from a minimal set of data. The proposed procedure also evaluates the initial positions and velocities of all components of the drive that are consistent with the kinematic joints or with the contact pairs used in the model. In this methodology, all links and sprockets are represented by rigid bodies connected to each other either by ideal or by clearance revolute joints. The clearance revolute joint contact is further extended to handle the contact between the chain rollers and the sprocket teeth exact profiles. A suitable cylindrical continuous contact law is applied to describe the interaction on all contact pairs. One of the complexities of the computational study of roller chain drives is the large number of bodies in the system and the dynamics of the successive engagement and disengagement of the rollers with the sprockets. Each time a roller engages or disengages with a sprocket tooth, the number of rigid bodies in contact changes. The search for the contact pairs is recognized as one of the most time consuming task in contact analysis. This work proposes a procedure to specify the contact pairs and their update during the dynamic analysis optimizing the computational efficiency of the contact search. The methodologies adopted result in a general computer program that is applied and demonstrated in a generic chain drive that can be used in industrial machines, vehicle engines or any other type of mechanical system.     

Synchronizing automata with finitely many minimal synchronizing words

A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors is synchronizing. We characterize the class of synchronizing automata having only finitely many minimal synchronizing words (the class of such automata is denoted by FG). Using this characterization we prove that any such automaton possesses a synchronizing word of length at most 3n-5. We also prove that checking whether a given DFA A is in FG is co-NP-hard and provide an algorithm for this problem which is exponential in the number of states A.     

An haptic-based immersive environment for shape analysis and modelling

Currently, the design of aesthetic products is a process that requires a set of activities where digital models and physical mockups play a key role. Typically, these are modified (and built) several times before reaching the desired design, increasing the development time and, consequently, the final product cost. In this paper, we present an innovative design environment for computer-aided design (CAD) surface analysis. Our system relies on a direct visuo-haptic display system, which enables users to visualize models using a stereoscopic view, and allows the evaluation of sectional curves using touch. Profile curves are rendered using an haptic device that deforms a plastic strip, thanks to a set of actuators, to reproduce the curvature of the shape co-located with the virtual model. By touching the strip, users are able to evaluate shape characteristics, such as curvature or discontinuities (rendered using sound), and to assess the surface quality. We believe that future computer-aided systems (CAS)/CAD systems based on our approach will contribute in improving the design process at industrial level. Moreover, these will allow companies to reduce the product development time by reducing the number of physical mockups necessary for the product design evaluation and by increasing the quality of the final product, allowing a wider exploration and comparative evaluation of alternatives in the given time.     

Daily impaired detachment and short-term effects of impaired sleep quality on next-day commuting near-accidents – an ambulatory diary study

This study investigated the short-term effects of daily recovery, that is, impaired psychological detachment from work and various actigraphical indicators of sleep quality, on near-accidents when commuting to work the next morning. Furthermore, the mediating effect of actigraphically assessed sleep quality on the relationship between impaired psychological detachment from work and near-accidents when commuting to work was analysed. Fifty-six full-time employees of a Swiss assurance company participated in the one-week study. Multilevel analyses revealed that impaired detachment was highly related to a decrease in sleep duration. Furthermore, impaired daily recovery processes, such as impaired psychological detachment from work and disturbed sleep quality, were related to commuting near-accidents. Impaired sleep quality mediated the effect of impaired psychological detachment from work on these near-accidents. Our results show that occupational safety interventions should address both impaired psychological detachment from work and sleep quality in order to prevent near accidents when commuting to work.

Practitioner Summary: Commuting accidents occur frequently and have detrimental effects on employees, organisations and society. This study shows that daily lack of recovery, that is, impaired psychological detachment and impaired sleep quality, is related to near-accidents when commuting to work the next morning. Primary prevention of commuting accidents should therefore address daily lack of recovery.     

EEG signal preprocessing for biometric recognition

Electroencephalography (EEG) has been recently investigated as a biometric modality for automatic people recognition purposes. Several studies have shown that brain signals possess subject-specific traits that allow distinguishing people. Nonetheless, extracting discriminative characteristics from EEG recordings may be a challenging task, due to the significant presence of artifacts in the acquired data. In order to cope with such issue, in this paper we evaluate the effectiveness of some preprocessing techniques in automatically removing undesired EEG contributions, with the aim of improving the achievable recognition rates. Specifically, methods based on blind source separation and sample entropy estimation are here investigated. An extensive set of experimental tests, performed over a large database comprising recordings taken from 50 healthy subjects during three distinct sessions spanning a period of about one month, in both eyes-closed and eyes-open conditions, is carried out to analyze the performance of the proposed approaches.     

Sensorless supervision of linear dynamical systems: The Feed-Forward Command Governor approach

This paper proposes a novel class of Command Governor (CG) strategies for input and state-related constrained discrete-time LTI systems subject to bounded disturbances in the absence of explicit state or output measurements. While in traditional CG schemes the set-point manipulation is undertaken on the basis of either the actual measure of the state or its suitable estimation, it is shown here that the CG design problem can be solved, with limited performance degradation and with similar properties, also in the case that such an explicit measure is not available. This approach, which will be referred to as the Feed-Forward CG (FF-CG) approach, may be a convenient alternative CG solution in all situations whereby the cost of measuring the state may be a severe limitation, e.g. in distributed or decentralized applications. In order to evaluate the method proposed here, numerical simulations on a physical example have been undertaken and comparisons with the standard state-based CG solution reported.