BACKGROUND Baclofen, the agonist of GABA(B) receptors, influences hypoxia-induced deficits in learning and memory processes. METHODS We studied the effects of baclofen on acquisition in the passive avoidance test and in the Morris water maze in groups of rats without or after hypoxia as well as the influence of baclofen on MMP-2 and MMP-9 levels in the hippocampus. RESULTS Even though baclo...

Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...

We research on the possible orientations patterns of a grid graph G, and propose a method for counting certain combinatorial structures over the class of orientations of G. For example, our method can be applied for counting sink-free orientations of G, as well as it can be applied for solving the #2SAT problem for grid Boolean formulas. Our proposal extends the classical transfer matrix method...

This article concerns the question: which subsets of R can be represented with Linear Matrix Inequalities, LMIs? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in control theory. Also before having much hope of representing engineering problems as LMIs by automatic methods one needs a good idea of which problems can and cannot be re...

Convention: Let A be a T×m matrix; the notation vec(A) will mean the Tmelement column vector whose first set of T elements are the first colum of A, that is a.1 using the dot notation for columns; the second set of T elements are those of the second column of A, a.2, and so on. Thus A = [a.1, a.2, · · · , a.m] in the dot notation. An immediate consequences of the above Convention is Vec of a pr...

1. An O(mm(n) log(n)) = O(nω+ ) algorithm which finds the shortest distance matrix for a graph G by recursively finding the shortest distance matrix for the graph G2. 2. The problem of determining the successor matrix for tripartite graphs. 3. O(nω) time algorithm for finding successor matrix in in a simple tripartite graph when there is a unique successor for any 2 vertices. 4. An O(mm(n) log(...