In the development of neuroinflammatory diseases, alterations of the blood brain barrier (BBB) represent key events. The integrity of the BBB is partially maintained by endothelia cells (ECs), since they actively limit the transmigration of immune cells. However, the factors that cause endothelial cells to develop an immune cell-permissive phenotype are poorly understood. In general, it has bee...

A sequence S is potentially Kp,1,1 graphical if it has a realization containing a Kp,1,1 as a subgraph, where Kp,1,1 is a complete 3partite graph with partition sizes p, 1, 1. Let σ(Kp,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Kp,1,1, n) is potentially Kp,1,1 graphical. In this paper, we prove that σ(Kp,1,1, n) ≥ 2[((p + 1)(n − 1) + 2)/2] f...

BACKGROUND The Wolf Motor Function Test (WMFT) evaluates the upper limb (UL) performance of adults with hemiparesis by combining time and quality of movement measures in both isolated movements and functional tasks. OBJECTIVES To translate and adapt the WMFT form, functional ability scale (FAS) and manual to Brazilian Portuguese and evaluate the intra and inter-rater reliabilities. METHODS ...

The generation of symmetric cryptographic keys out of wireless channel properties represents a promising approach for the establishment of secured communication links. Despite the tremendous number of different channel-based key generation protocols, there is little research on security evaluation and fair comparison of those systems. We present suitable metrics and a source model for a securit...

A sequence S is potentially Kp,1,1 graphical if it has a realization containing a Kp,1,1 as a subgraph, where Kp,1,1 is a complete 3-partite graph with partition sizes p, 1, 1. Let σ(Kp,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Kp,1,1, n) is potentially Kp,1,1 graphical. In this paper, we prove that σ(Kp,1,1, n) ≥ 2[((p + 1)(n − 1) + 2)/2] ...

A sequence S is potentially Kp,1,1 graphical if it has a realization containing a Kp,1,1 as a subgraph, where Kp,1,1 is a complete 3partite graph with partition sizes p, 1, 1. Let σ(Kp,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Kp,1,1, n) is potentially Kp,1,1 graphical. In this paper, we prove that σ(Kp,1,1, n) ≥ 2[((p + 1)(n − 1) + 2)/2] f...

It is shown that the solutions of the pure initial-value problem for the KP and regularized KP equations are the same, within the order of accuracy attributable to either, on the time scale 0 ≤ t ≤ −3/2 , during which nonlinear and dispersive effects may accumulate to make an order-one relative difference to the wave profiles. under the Creative Commons Attribution License, which permits unrest...

A new learning method, the fuzzy kernel perceptron (FKP), in which the fuzzy perceptron (FP) and the Mercer kernels are incorporated, is proposed in this paper. The proposed method first maps the input data into a high-dimensional feature space using some implicit mapping functions. Then, the FP is adopted to find a linear separating hyperplane in the high-dimensional feature space. Compared wi...