4,548,036 research outputs found
Fast decoding of a d(min) = 6 RS code
A method for high speed decoding a d sub min = 6 Reed-Solomon (RS) code is presented. Properties of the two byte error correcting and three byte error detecting RS code are discussed. Decoding using a quadratic equation is shown. Theorems and concomitant proofs are included to substantiate this decoding method
Dynamin Is Functionally Coupled to Insulin Granule Exocytosis
The insulin granule integral membrane protein marker phogrin-green fluorescent protein was co-localized with insulin in Min6B1 beta-cell secretory granules but did not undergo plasma membrane translocation following glucose stimulation. Surprisingly, although expression of a dominant-interfering dynamin mutant (Dyn/K44A) inhibited transferrin receptor endocytosis, it had no effect on phogringreen fluorescent protein localization in the basal or secretagogue-stimulated state. By contrast, co-expression of Dyn/K44A with human growth hormone as an insulin secretory marker resulted in a marked inhibition of human growth hormone release by glucose, KCl, and a combination of multiple secretagogues. Moreover, serial pulse depolarization stimulated an increase in cell surface capacitance that was also blocked in cells expressing Dyn/K44A. Similarly, small interference RNA-mediated knockdown of dynamin resulted in marked inhibition of glucose-stimulated insulin secretion. Together, these data suggest the presence of a selective kiss and run mechanism of insulin release. Moreover, these data indicate a coupling between endocytosis and exocytosis in the regulation of beta-cell insulin secretion
Словарь опечаток, слова живаго суржика бытия
This is a popular philosophy book that offers ironic approach to analysis of post-Soviet societies and cultures. Author collected over 100 misprints that articulate deviant practices of currupt and kleptocratic societies. Stragedy instead of strategy, acomedy instead of academy, and many other new Concepts get interpreted and lead to a creation of new post-modern post-Soviet Encyclopedy
-invariant symplectic hypersurfaces in dimension and the Fano condition
We prove that any symplectic Fano -manifold with a Hamiltonian
-action is simply connected and satisfies . This is done by
showing that the fixed submanifold on which the
Hamiltonian attains its minimum is diffeomorphic to either a del Pezzo surface,
a -sphere or a point. In the case when , we use the fact
that symplectic Fano -manifolds are symplectomorphic to del Pezzo surfaces.
The case when involves a study of -dimensional
Hamiltonian -manifolds with diffeomorphic to a surface of
positive genus. By exploiting an analogy with the algebro-geometric situation
we construct in each such -manifold an -invariant symplectic
hypersurface playing the role of a smooth fibre of a hypothetical
Mori fibration over . This relies upon applying Seiberg-Witten theory
to the resolution of symplectic -orbifolds occurring as the reduced spaces
of .Comment: Exposition improve
Graphs with Diameter Minimizing the Spectral Radius
The spectral radius of a graph is the largest eigenvalue of its
adjacency matrix . For a fixed integer , let be
a graph with minimal spectral radius among all connected graphs on vertices
with diameter . Let be a tree
obtained from a path of vertices () by
linking one pendant path at for each . For
, were determined in the literature.
Cioab\v{a}-van Dam-Koolen-Lee \cite{CDK} conjectured for fixed ,
is in the family . For , they conjectured
and
. In this paper, we settle
their three conjectures positively. We also determine in this
paper
Dynamics of Surface Roughening with Quenched Disorder
We study the dynamical exponent for the directed percolation depinning
(DPD) class of models for surface roughening in the presence of quenched
disorder. We argue that for dimensions is equal to the exponent
characterizing the shortest path between two sites in an
isotropic percolation cluster in dimensions. To test the argument, we
perform simulations and calculate for DPD, and for
percolation, from to .Comment: RevTex manuscript 3 pages + 6 figures (obtained upon request via
email [email protected]
Non-Asymptotic Analysis of Privacy Amplification via Renyi Entropy and Inf-Spectral Entropy
This paper investigates the privacy amplification problem, and compares the
existing two bounds: the exponential bound derived by one of the authors and
the min-entropy bound derived by Renner. It turns out that the exponential
bound is better than the min-entropy bound when a security parameter is rather
small for a block length, and that the min-entropy bound is better than the
exponential bound when a security parameter is rather large for a block length.
Furthermore, we present another bound that interpolates the exponential bound
and the min-entropy bound by a hybrid use of the Renyi entropy and the
inf-spectral entropy.Comment: 6 pages, 4 figure
- …