Rapid Aging as a Key to Understand Deactivation of Ni/Al2O3 Catalysts Applied for the CO2 Methanation

Catalysis Letters - We developed a rapid aging method for Ni/Al2O3 methanation catalysts mimicking the real aging in the actual application. The method is based on hydrothermal deactivation of the...     

Functional Coupling of Slack Channels and P2X3 Receptors Contributes to Neuropathic Pain Processing

The sodium-activated potassium channel Slack (K_Na1.1, Slo2.2, or Kcnt1) is highly expressed in populations of sensory neurons, where it mediates the sodium-activated potassium current (I_KNa) and modulates neuronal activity. Previous studies suggest that Slack is involved in the processing of neuropathic pain. However, mechanisms underlying the regulation of Slack activity in this context are poorly understood. Using whole-cell patch-clamp recordings we found that Slack-mediated I_KNa in sensory neurons of mice is reduced after peripheral nerve injury, thereby contributing to neuropathic pain hypersensitivity. Interestingly, Slack is closely associated with ATP-sensitive P2X3 receptors in a population of sensory neurons. In vitro experiments revealed that Slack-mediated I_KNa may be bidirectionally modulated in response to P2X3 activation. Moreover, mice lacking Slack show altered nocifensive responses to P2X3 stimulation. Our study identifies P2X3/Slack signaling as a mechanism contributing to hypersensitivity after peripheral nerve injury and proposes a potential novel strategy for treatment of neuropathic pain.     

Single Cell Bioprinting with Ultrashort Laser Pulses

Tissue engineering requires the precise positioning of mammalian cells and biomaterials on substrate surfaces or in preprocessed scaffolds. Although the development of 2D and 3D bioprinting technologies has made substantial progress in recent years, precise, cell-friendly, easy to use, and fast technologies for selecting and positioning mammalian cells with single cell precision are still in need. A new laser-based bioprinting approach is therefore presented, which allows the selection of individual cells from complex cell mixtures based on morphology or fluorescence and their transfer onto a 2D target substrate or a preprocessed 3D scaffold with single cell precision and high cell viability (93–99% cell survival, depending on cell type and substrate). In addition to precise cell positioning, this approach can also be used for the generation of 3D structures by transferring and depositing multiple hydrogel droplets. By further automating and combining this approach with other 3D printing technologies, such as two-photon stereolithography, it has a high potential of becoming a fast and versatile technology for the 2D and 3D bioprinting of mammalian cells with single cell resolution.     

Statistical hierarchical clustering algorithm for outlier detection in evolving data streams

Machine Learning - Anomaly detection is a hard data analysis process that requires constant creation and improvement of data analysis algorithms. Using traditional clustering algorithms to analyse...     

Dependences in Strategy Logic

Strategy Logic (SL) is a very expressive temporal logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express LTL properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not correspond to what is expected. In this paper, we focus on strategy dependences in SL, by tracking how existentially-quantified strategies in a formula may (or may not) depend on other strategies selected in the formula, revisiting the approach of [Mogavero et al., Reasoning about strategies: On the model-checking problem, 2014]. We explain why elementary dependences, as defined by Mogavero et al., do not exactly capture the intended concept of behavioral strategies. We address this discrepancy by introducing timeline dependences, and exhibit a large fragment of SL for which model checking can be performed in 2-EXPTIME under this new semantics.     

Extracting safe thread schedules from incomplete model checking results

Model checkers frequently fail to completely verify a concurrent program, even if partial-order reduction is applied. The verification engineer is left in doubt whether the program is safe and the effort toward verifying the program is wasted. We present a technique that uses the results of such incomplete verification attempts to construct a (fair) scheduler that allows the safe execution of the partially verified concurrent program. This scheduler restricts the execution to schedules that have been proven safe (and prevents executions that were found to be erroneous). We evaluate the performance of our technique and show how it can be improved using partial-order reduction. While constraining the scheduler results in a considerable performance penalty in general, we show that in some cases our approach—somewhat surprisingly—even leads to faster executions.

     

Experiencing CSCL: from motivation to the embodied experience and beyond

International Journal of Computer-Supported Collaborative Learning -     

Building community together: towards equitable CSCL practices and processes

International Journal of Computer-Supported Collaborative Learning -