303 research outputs found
Neural Networks Compression for Language Modeling
In this paper, we consider several compression techniques for the language
modeling problem based on recurrent neural networks (RNNs). It is known that
conventional RNNs, e.g, LSTM-based networks in language modeling, are
characterized with either high space complexity or substantial inference time.
This problem is especially crucial for mobile applications, in which the
constant interaction with the remote server is inappropriate. By using the Penn
Treebank (PTB) dataset we compare pruning, quantization, low-rank
factorization, tensor train decomposition for LSTM networks in terms of model
size and suitability for fast inference.Comment: Keywords: LSTM, RNN, language modeling, low-rank factorization,
pruning, quantization. Published by Springer in the LNCS series, 7th
International Conference on Pattern Recognition and Machine Intelligence,
201
Averages of Fourier coefficients of Siegel modular forms and representation of binary quadratic forms by quadratic forms in four variables
Let be a a negative discriminant and let vary over a set of
representatives of the integral equivalence classes of integral binary
quadratic forms of discriminant . We prove an asymptotic formula for for the average over of the number of representations of by an
integral positive definite quaternary quadratic form and obtain results on
averages of Fourier coefficients of linear combinations of Siegel theta series.
We also find an asymptotic bound from below on the number of binary forms of
fixed discriminant which are represented by a given quaternary form. In
particular, we can show that for growing a positive proportion of the
binary quadratic forms of discriminant is represented by the given
quaternary quadratic form.Comment: v5: Some typos correcte
Prodsimplicial-Neighborly Polytopes
Simultaneously generalizing both neighborly and neighborly cubical polytopes,
we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to
that of a product of r simplices. We construct PSN polytopes by three different
methods, the most versatile of which is an extension of Sanyal and Ziegler's
"projecting deformed products" construction to products of arbitrary simple
polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1.
Using topological obstructions similar to those introduced by Sanyal to bound
the number of vertices of Minkowski sums, we show that this dimension is
minimal if we additionally require that the PSN polytope is obtained as a
projection of a polytope that is combinatorially equivalent to the product of r
simplices, when the dimensions of these simplices are all large compared to k.Comment: 28 pages, 9 figures; minor correction
Form Factors and Wave Functions of Vector Mesons in Holographic QCD
Within the framework of a holographic dual model of QCD, we develop a
formalism for calculating form factors of vector mesons. We show that the
holographic bound states can be described not only in terms of eigenfunctions
of the equation of motion, but also in terms of conjugate wave functions that
are close analogues of quantum-mechanical bound state wave functions. We derive
a generalized VMD representation for form factors, and find a very specific VMD
pattern, in which form factors are essentially given by contributions due to
the first two bound states in the Q^2-channel. We calculate electric radius of
the rho-meson, finding the value _C = 0.53 fm^2.Comment: 7 pages, RevTex. References were added, some modifications in the
text were mad
On complex surfaces diffeomorphic to rational surfaces
In this paper we prove that no complex surface of general type is
diffeomorphic to a rational surface, thereby completing the smooth
classification of rational surfaces and the proof of the Van de Ven conjecture
on the smooth invariance of Kodaira dimension.Comment: 34 pages, AMS-Te
Fibrin Glue Coating Limits Scar Tissue Formation around Peripheral Nerves
Scar tissue formation presents a significant barrier to peripheral nerve recovery in clinical practice. While different experimental methods have been described, there is no clinically available gold standard for its prevention. This study aims to determine the potential of fibrin glue (FG) to limit scarring around peripheral nerves. Thirty rats were divided into three groups: glutaraldehyde-induced sciatic nerve injury treated with FG (GA + FG), sciatic nerve injury with no treatment (GA), and no sciatic nerve injury (Sham). Neural regeneration was assessed with weekly measurements of the visual static sciatic index as a parameter for sciatic nerve function across a 12-week period. After 12 weeks, qualitative and quantitative histological analysis of scar tissue formation was performed. Furthermore, histomorphometric analysis and wet muscle weight analysis were performed after the postoperative observation period. The GA + FG group showed a faster functional recovery (6 versus 9 weeks) compared to the GA group. The FG-treated group showed significantly lower perineural scar tissue formation and significantly higher fiber density, myelin thickness, axon thickness, and myelinated fiber thickness than the GA group. A significantly higher wet muscle weight ratio of the tibialis anterior muscle was found in the GA + FG group compared to the GA group. Our results suggest that applying FG to injured nerves is a promising scar tissue prevention strategy associated with improved regeneration both at the microscopic and at the functional level. Our results can serve as a platform for innovation in the field of perineural regeneration with immense clinical potential.</p
Fibrin Glue Coating Limits Scar Tissue Formation around Peripheral Nerves
Scar tissue formation presents a significant barrier to peripheral nerve recovery in clinical practice. While different experimental methods have been described, there is no clinically available gold standard for its prevention. This study aims to determine the potential of fibrin glue (FG) to limit scarring around peripheral nerves. Thirty rats were divided into three groups: glutaraldehyde-induced sciatic nerve injury treated with FG (GA + FG), sciatic nerve injury with no treatment (GA), and no sciatic nerve injury (Sham). Neural regeneration was assessed with weekly measurements of the visual static sciatic index as a parameter for sciatic nerve function across a 12-week period. After 12 weeks, qualitative and quantitative histological analysis of scar tissue formation was performed. Furthermore, histomorphometric analysis and wet muscle weight analysis were performed after the postoperative observation period. The GA + FG group showed a faster functional recovery (6 versus 9 weeks) compared to the GA group. The FG-treated group showed significantly lower perineural scar tissue formation and significantly higher fiber density, myelin thickness, axon thickness, and myelinated fiber thickness than the GA group. A significantly higher wet muscle weight ratio of the tibialis anterior muscle was found in the GA + FG group compared to the GA group. Our results suggest that applying FG to injured nerves is a promising scar tissue prevention strategy associated with improved regeneration both at the microscopic and at the functional level. Our results can serve as a platform for innovation in the field of perineural regeneration with immense clinical potential.</p
Volumes of polytopes in spaces of constant curvature
We overview the volume calculations for polyhedra in Euclidean, spherical and
hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary
tetrahedron in and . We also present some results, which provide a
solution for Seidel problem on the volume of non-Euclidean tetrahedron.
Finally, we consider a convex hyperbolic quadrilateral inscribed in a circle,
horocycle or one branch of equidistant curve. This is a natural hyperbolic
analog of the cyclic quadrilateral in the Euclidean plane. We find a few
versions of the Brahmagupta formula for the area of such quadrilateral. We also
present a formula for the area of a hyperbolic trapezoid.Comment: 22 pages, 9 figures, 58 reference
Using exchange structure analysis to explore argument in text-based computer conferences
Computer conferencing provides a new site for students to develop and rehearse argumentation skills, but much remains to be learnt about how to encourage and support students in this environment. Asynchronous text-based discussion differs in significant ways from face-to-face discussion, creating a need for specially designed schemes for analysis. This paper discusses some of the problems of analysing asynchronous argumentation, and puts forward an analytical framework based on exchange structure analysis, which brings a linguistic perspective to bear on the interaction. Key features of the framework are attention to both interactive and ideational aspects of the discussion,
and the ability to track the dynamic construction of argument content. The paper outlines the framework itself, and discusses some of the findings afforded by this type of analysis, and its limitations
Small doubling in groups
Let A be a subset of a group G = (G,.). We will survey the theory of sets A
with the property that |A.A| <= K|A|, where A.A = {a_1 a_2 : a_1, a_2 in A}.
The case G = (Z,+) is the famous Freiman--Ruzsa theorem.Comment: 23 pages, survey article submitted to Proceedings of the Erdos
Centenary conferenc
- …