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

S1S^{1}-invariant symplectic hypersurfaces in dimension 66 and the Fano condition

We prove that any symplectic Fano $6$-manifold $M$ with a Hamiltonian $S^1$-action is simply connected and satisfies $c_1 c_2(M)=24$. This is done by showing that the fixed submanifold $M_{\min}\subseteq M$ on which the Hamiltonian attains its minimum is diffeomorphic to either a del Pezzo surface, a $2$-sphere or a point. In the case when $\dim(M_{\min})=4$, we use the fact that symplectic Fano $4$-manifolds are symplectomorphic to del Pezzo surfaces. The case when $\dim(M_{\min})=2$ involves a study of $6$-dimensional Hamiltonian $S^1$-manifolds with $M_{\min}$ diffeomorphic to a surface of positive genus. By exploiting an analogy with the algebro-geometric situation we construct in each such $6$-manifold an $S^1$-invariant symplectic hypersurface ${\cal F}(M)$ playing the role of a smooth fibre of a hypothetical Mori fibration over $M_{\min}$. This relies upon applying Seiberg-Witten theory to the resolution of symplectic $4$-orbifolds occurring as the reduced spaces of $M$.Comment: Exposition improve

Graphs with Diameter n−en-e Minimizing the Spectral Radius

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices with diameter $n-e$. Let $P_{n_1,n_2,...,n_t,p}^{m_1,m_2,...,m_t}$ be a tree obtained from a path of $p$ vertices ($0 \sim 1 \sim 2 \sim ... \sim (p-1)$) by linking one pendant path $P_{n_i}$ at $m_i$ for each $i\in\{1,2,...,t\}$. For $e=1,2,3,4,5$, $G^{min}_{n,n-e}$ were determined in the literature. Cioab\v{a}-van Dam-Koolen-Lee \cite{CDK} conjectured for fixed $e\geq 6$, $G^{min}_{n,n-e}$ is in the family ${\cal P}_{n,e}=\{P_{2,1,...1,2,n-e+1}^{2,m_2,...,m_{e-4},n-e-2}\mid 2<m_2<...<m_{e-4}<n-e-2\}$. For $e=6,7$, they conjectured $G^{min}_{n,n-6}=P^{2,\lceil\frac{D-1}{2}\rceil,D-2}_{2,1,2,n-5}$ and $G^{min}_{n,n-7}=P^{2,\lfloor\frac{D+2}{3}\rfloor,D- \lfloor\frac{D+2}{3}\rfloor, D-2}_{2,1,1,2,n-6}$. In this paper, we settle their three conjectures positively. We also determine $G^{min}_{n,n-8}$ in this paper

Dynamics of Surface Roughening with Quenched Disorder

We study the dynamical exponent $z$ for the directed percolation depinning (DPD) class of models for surface roughening in the presence of quenched disorder. We argue that $z$ for $(d+1)$ dimensions is equal to the exponent $d_{\rm min}$ characterizing the shortest path between two sites in an isotropic percolation cluster in $d$ dimensions. To test the argument, we perform simulations and calculate $z$ for DPD, and $d_{\rm min}$ for percolation, from $d = 1$ to $d = 6$.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