Cortical disinhibition occurs in chronic neuropathic,but not in chronic nociceptive pain

Background  

The aim of this study was to examine the relationship between chronic neuropathic pain after incomplete peripheral nerve lesion, chronic nociceptive pain due to osteoarthritis, and the excitability of the motor cortex assessed by transcranial magnetic stimulation (TMS). Hence in 26 patients with neuropathic pain resulting from an isolated incomplete lesion of the median or ulnar nerve (neuralgia), 20 patients with painful osteoarthritis of the hand, and 14 healthy control subjects, the excitability of the motor cortex was tested using paired-pulse TMS to assess intracortical inhibition and facilitation. These excitability parameters were compared between groups, and the relationship between excitability parameters and clinical parameters was examined.     

Normal analytic polyhedra in ℂ2 with a noncompact automorphism group

Let P be a bounded analytic polyhedron in ℂ² whose boundary is smooth except for normal crossing singularities. We show that P is a holomorphic quotient of the bidisc, if its automorphism group is noncompact.     

Primal separation algorithms

Given an integer polyhedron , an integer point , and a point , the primal separation problem is the problem of finding a linear inequality which is valid for P _I , violated by x ^*, and satisfied at equality by . The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.Received: November 2002, Revised: March 2003,     

Is breaking of ensemble equivalence monotone in the number of constraints?

Breaking of ensemble equivalence between the microcanonical ensemble and the canonical ensemble may occur for random graphs whose size tends to infinity, and is signaled by a non-zero specific relative entropy between the two ensembles. In Garlaschelli et al. (2017) and Garlaschelli et al. (0000) it was shown that breaking occurs when the constraint is put on the degree sequence (configuration model). It is not known what is the effect on the relative entropy when the number of constraints is reduced, i.e., when only part of the nodes are constrained in their degree (and the remaining nodes are left unconstrained). Intuitively, the relative entropy is expected to decrease. However, this is not a trivial issue because when constraints are removed both the microcanonical ensemble and the canonical ensemble change. In this paper a formula for the relative entropy valid for generic discrete random structures, recently formulated by Squartini and Garlaschelli, is used to prove that the relative entropy is monotone in the number of constraints when the constraint is on the degrees of the nodes. It is further shown that the expression for the relative entropy corresponds, in the dense regime, to the degrees in the microcanonical ensemble being asymptotically multivariate Dirac and in the canonical ensemble being asymptotically Gaussian.     

Nonlinear Double-well Schrödinger Equations in the Semiclassical Limit

We consider time-dependent Schrödinger equations with a double well potential and an external nonlinear, both local and non-local, perturbation. In the semiclassical limit, the finite dimensional eigenspace associated to the lowest eigenvalues of the linear operator is almost invariant for times of the order of the beating period and the dominant term of the wavefunction is given by means of the solutions of a finite dimensional dynamical system. In the case of local nonlinear perturbation, we assume the spatial dimension d=1 or d=2.     

On the complexity of some subgraph problems

We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3.     

The Behavior of Solutions of Multidimensional Aggregation Equations with Mildly Singular Interaction Kernels

The authors consider the multidimensional aggregation equation tp-div（p K＊ ρ） = 0 in which the radially symmetric attractive interaction kernel has a mild singularity at the origin （Lipschitz or better）, and review recent results on this problem concerning well-posedness of nonnegative solutions and finite time blowup in multiple space dimensions depending on the behavior of the kernel at the origin. The problem with bounded initial data, data in L^p ∩ L^1, and measure solutions are also considered.     

Closed trail decompositions of complete equipartite graphs

The complete equipartite graph $K_m * {\overline{K_n}}$ has mn vertices partitioned into m parts of size n, with two vertices adjacent if and only if they are in different parts. In this paper, we determine necessary and sufficient conditions for the existence of a decomposition of $K_m * {\overline{K_n}}$ into closed trails of length k. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 374–403, 2009     

A Biocatalytic Cascade for Versatile One‐Pot Modification of mRNA Starting from Methionine Analogues

Methyltransferases have proven useful to install functional groups site‐specifically in different classes of biomolecules when analogues of their cosubstrate S‐adenosyl‐l ‐methionine (AdoMet) are available. Methyltransferases have been used to address different classes of RNA molecules selectively and site‐specifically, which is indispensable for biophysical and mechanistic studies as well as labeling in the complex cellular environment. However, the AdoMet analogues are not cell‐permeable, thus preventing implementation of this strategy in cells. We present a two‐step enzymatic cascade for site‐specific mRNA modification starting from stable methionine analogues. Our approach combines the enzymatic synthesis of AdoMet with modification of the 5′ cap by a specific RNA methyltransferase in one pot. We demonstrate that a substrate panel including alkene, alkyne, and azido functionalities can be used and further derivatized in different types of click reactions.     

Role and effective treatment of dispersive forces in materials: Polyethylene and graphite crystals as test cases

A semiempirical addition of dispersive forces to conventional density functionals (DFT-D) has been implemented into a pseudopotential plane-wave code. Test calculations on the benzene dimer reproduced the results obtained by using localized basis set, provided that the latter are corrected for the basis set superposition error. By applying the DFT-D/plane-wave approach a substantial agreement with experiments is found for the structure and energetics of polyethylene and graphite, two typical solids that are badly described by standard local and semilocal density functionals.