Hydrogen storage performance of methyl-substituted mesoporous silica with tailored textural characteristics

Journal of Porous Materials - The present study reports a systematic analysis of morphology and hydrogen sorption capacity of mesoporous organic-inorganic silica prepared by varying the silica...     

Connexin 43 and Connexin 26 Involvement in the Ponatinib-Induced Cardiomyopathy: Sex-Related Differences in a Murine Model

Cardiac connexins (Cxs) are proteins responsible for proper heart function. They form gap junctions that mediate electrical and chemical signalling throughout the cardiac system, and thus enable a synchronized contraction. Connexins can also individually participate in many signal transduction pathways, interacting with intracellular proteins at various cellular compartments. Altered connexin expression and localization have been described in diseased myocardium and the aim of this study is to assess the involvement of Cx43, Cx26, and some related molecules in ponatinib-induced cardiac toxicity. Ponatinib is a new multi-tyrosine kinase inhibitor that has been successfully used against human malignancies, but its cardiotoxicity remains worrisome. Therefore, understanding its signaling mechanism is important to adopt potential anti cardiac damage strategies. Our experiments were performed on hearts from male and female mice treated with ponatinib and with ponatinib plus siRNA-Notch1 by using immunofluorescence, Western blotting, and proteomic analyses. The altered cardiac function and the change in Cxs expression observed in mice after ponatinib treatment, were results dependent on the Notch1 pathway and sex. Females showed a lower susceptibility to ponatinib than males. The downmodulation of cardiac Cx43, Cx26 and miR-122, high pS368-Cx43 phosphorylation, cell viability and survival activation could represent some of the female adaptative/compensatory reactions to ponatinib cardiotoxicity.     

Translational Parallel Manipulators: New Proposals

Translational parallel manipulators are parallel manipulators wherein the end‐effector performs only spatial translations. This paper presents a new family of translational parallel manipulators. The manipulators of this family are independent constraint manipulators. They have three limbs that are topologically identical and have no rotation singularity. The limbs of these manipulators feature five one‐degree‐of‐freedom kinematic pairs in series. Four joints are revolute pairs and the remaining one, called T‐pair, is a kinematic pair that can be manufactured in different ways. In each limb, three adjacent revolute pairs have parallel axes and the remaining revolute pair has an axis that is not parallel to the axes of the other revolute pairs. The mobility analysis of the manipulators of this new family is addressed by taking into account two different choices for the actuated pairs. One of the results of this analysis is that the geometry of a translational parallel manipulator free from singularities can be defined for a particular choice of the actuated pairs. © 2002 Wiley Periodicals, Inc.     

The multi-modal interface of Robot-Era multi-robot services tailored for the elderly

Socially assistive robotic platforms are now a realistic option for the long-term care of ageing populations. Elderly users may benefit from many services provided by robots operating in different environments, such as providing assistance inside apartments, serving in shared facilities of buildings or guiding people outdoors. In this paper, we present the experience gained within the EU FP7 ROBOT-ERA project towards the objective of implementing easy-to-use and acceptable service robotic system for the elderly. In particular, we detail the user-centred design and the experimental evaluation in realistic environments of a web-based multi-modal user interface tailored for elderly users of near future multi-robot services. Experimental results demonstrate positive evaluation of usability and willingness to use by elderly users, especially those less experienced with technological devices who could benefit more from the adoption of robotic services. Further analyses showed how multi-modal modes of interaction support more flexible and natural elderly–robot interaction, make clear the benefits for the users and, therefore, increase its acceptability. Finally, we provide insights and lessons learned from the extensive experimentation, which, to the best of our knowledge, is one of the largest experimentation of a multi-robot multi-service system so far.     

On the Virtualization of CUDA Based GPU Remoting on ARM and X86 Machines in the GVirtuS Framework

The astonishing development of diverse and different hardware platforms is twofold: on one side, the challenge for the exascale performance for big data processing and management; on the other side, the mobile and embedded devices for data collection and human machine interaction. This drove to a highly hierarchical evolution of programming models. GVirtuS is the general virtualization system developed in 2009 and firstly introduced in 2010 enabling a completely transparent layer among GPUs and VMs. This paper shows the latest achievements and developments of GVirtuS, now supporting CUDA 6.5, memory management and scheduling. Thanks to the new and improved remoting capabilities, GVirtus now enables GPU sharing among physical and virtual machines based on x86 and ARM CPUs on local workstations, computing clusters and distributed cloud appliances.     

Air and HST Multimodal Products. A Segmentation Analysis for Policy Makers

Different solutions for the integration of high-speed rail (HSR) and air transport could be implemented, ranging from very basic integration to more sophisticated systems that include ticket and handling integration. This paper uses two statistical techniques, name cluster analysis and discrete choice models in order to investigate how different market segments have a determining influence in being more proactive to change to HSR for the second leg in multimodal trips. A discrete choice experiment is conducted to better understand passengers’ preferences. We obtain a number of clusters and estimate flexible choice models, taking into account the panel nature of stated preference data. We obtain a range of willingness-to-pay values for service quality attributes, finding results that can be used to infer policy conclusions about the real attractiveness of the Air-HSR integrated alternative. In this respect, clusters and schedule coordination, which reduces connecting time, are crucial to explain HSR attractiveness.     

Robust control of uncertain multi-inventory systems via linear matrix inequality

We consider a continuous time linear multi-inventory system with unknown demands bounded within ellipsoids and controls bounded within ellipsoids or polytopes. We address the problem of ε-stabilising the inventory since this implies some reduction of the inventory costs. The main results are certain conditions under which ε-stabilisability is possible through a saturated linear state feedback control. All the results are based on a linear matrix inequalities approach and on some recent techniques for the modelling and analysis of polytopic systems with saturations. Numerical simulations are provided.     

Real-time risk monitoring in business processes: A sensor-based approach

This article proposes an approach for real-time monitoring of risks in executable business process models. The approach considers risks in all phases of the business process management lifecycle, from process design, where risks are defined on top of process models, through to process diagnosis, where risks are detected during process execution. The approach has been realized via a distributed, sensor-based architecture. At design-time, sensors are defined to specify risk conditions which when fulfilled, are a likely indicator of negative process states (faults) to eventuate. Both historical and current process execution data can be used to compose such conditions. At run-time, each sensor independently notifies a sensor manager when a risk is detected. In turn, the sensor manager interacts with the monitoring component of a business process management system to prompt the results to process administrators who may take remedial actions. The proposed architecture has been implemented on top of the YAWL system, and evaluated through performance measurements and usability tests with students. The results show that risk conditions can be computed efficiently and that the approach is perceived as useful by the participants in the tests.     

Minutia Cylinder-Code: a new representation and matching technique for fingerprint recognition

In this paper, we introduce the Minutia Cylinder-Code (MCC): a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles. The cylinders can be created starting from a subset of the mandatory features (minutiae position and direction) defined by standards like ISO/IEC 19794-2 (2005). Thanks to the cylinder invariance, fixed-length, and bit-oriented coding, some simple but very effective metrics can be defined to compute local similarities and to consolidate them into a global score. Extensive experiments over FVC2006 databases prove the superiority of MCC with respect to three well-known techniques and demonstrate the feasibility of obtaining a very effective (and interoperable) fingerprint recognition implementation for light architectures.     

On-Line Construction of Two-Dimensional Suffix Trees in O(n<Superscript>2</Superscript> log n) Time

The two-dimensional suffix tree of an n × n square matrix A is a compacted trie that represents all square submatrices of A[11]. For the off-line case, i.e., A is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet size [11],[18]. Motivated by applications in Image Compression[22[, Giancarlo and Guaiana [14] considered the on-line version of the two-dimensional suffix tree and presented an O(n² log² n)-time algorithm, which we refer to as GG. That algorithm is a nontrivial generalization of Ukkonen's on-line algorithm for standard suffix trees [23]. The main contribution in this paper is an O(log n) factor improvement in the time complexity of the GG algorithm, making it optimal for unbounded alphabets [9]. Moreover, the ideas presented here also lead to a major simplification of the GG algorithm. Technically, we are able to preserve most of the structure of the original GG algorithm, by reducing a computational bottleneck to a primitive operation, i.e., comparison of Lcharacters, which is here implemented in constant time rather than O(log n) time as in GG. However, preserving that structure comes at a price. Indeed, in order to make everything work, we need a careful reorganization of another fundamental algorithm: Weiner's algorithm for the construction of standard suffix trees [24]. Specifically, here we provide a version of that algorithm which takes linear time and works on-line and concurrently over a set of strings.