Differences in virus receptor for type I and type II feline infectious peritonitis virus.

Feline infectious peritonitis viruses (FIPVs) are classified into type I and type II serogroups. Here, we report that feline aminopeptidase N (APN), a cell-surface metalloprotease on the intestinal, lung and kidney epithelial cells, is a receptor for type II FIPV but not for type I FIPV. A monoclonal antibody (MAb) R-G-4, which blocks infection of Felis catus whole fetus (fcwf-4) cells by type II FIPV, was obtained by immunizing mice with fcwf-4 cells which are highly susceptible to FIPV. This MAb also blocked infection of fcwf-4 cells by type II feline enteric coronavirus (FECV), canine coronavirus (CCV), and transmissible gastroenteritis virus (TGEV). On the other hand, it did not block infection by type I FIPVs. MAb R-G-4 recognized a polypeptide of relative molecular mass 120-130 kDa in feline intestinal brush-border membrane (BBM) proteins. The polypeptide possessed aminopeptidase activity, and the first 15 N-terminal amino acid sequence was identical to that of the feline APN. Feline intestinal BBM proteins and the polypeptide reacted with MAb R-G-4 (feline APN) inhibited the infectivity of type II FIPV, type II FECV, CCV and TGEV to fcwf-4 cells, but did not inhibit the infectivity of type I FIPVs

Fatigue strength improvement of AISI E52100 bearing steel by induction heating and repeated quenching

Martensitic high carbon high strength AISI E52100 steel (JIS SUJ2) is one of the main alloys used in rolling contact applications when high wear and fatigue resistance are required. In this work, repeated induction heating and quenching of AISI E52100 is proposed and the refinement of the martensite structure and consequently improvement of the fatigue properties measured by rotating bending fatigue tests of steel parts is reported.Високовуглецеву високоміцну мартенситну сталь AISI E52100 (JIS SUJ2) найчастіше використовують за умов контактного кочення, де необхідні підвищені зносотривкість та втомна міцність. Запропоновано методи повторного індукційного нагріву та гартування сталі, внаслідок чого подрібнюється структура мартенситу та поліпшуються втомні властивості під час випробувань сталевих зразків за циклічного згину.Высокоуглеродистую высокопрочную мартенситную сталь AISI E52100 (JIS SUJ2) наиболее часто используют в условиях контактного качения, когда необходимы повышенные износостойкость и усталостная прочность. Предложены методы повторного индукционного нагрева и закаливания стали, вследствие чего измельчается структура мартенситна и улучшаются усталостные свойства во время испытаний стальных образцов при циклическом изгибе

Characterization of polycrystalline SiC films grown by HW-CVD using silicon tetrafluoride

ArticleTHIN SOLID FILMS. 516(5): 637-640 (2008)journal articl

On the three-dimensional temporal spectrum of stretched vortices

The three-dimensional stability problem of a stretched stationary vortex is addressed in this letter. More specifically, we prove that the discrete part of the temporal spectrum is only associated with two-dimensional perturbations.Comment: 4 pages, RevTeX, submitted to PR

Efficient LZ78 factorization of grammar compressed text

We present an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string. Given an SLP of size $n$ representing a text $S$ of length $N$, our algorithm computes the LZ78 factorization of $T$ in $O(n\sqrt{N}+m\log N)$ time and $O(n\sqrt{N}+m)$ space, where $m$ is the number of resulting LZ78 factors. We also show how to improve the algorithm so that the $n\sqrt{N}$ term in the time and space complexities becomes either $nL$, where $L$ is the length of the longest LZ78 factor, or $(N - \alpha)$ where $\alpha \geq 0$ is a quantity which depends on the amount of redundancy that the SLP captures with respect to substrings of $S$ of a certain length. Since $m = O(N/\log_\sigma N)$ where $\sigma$ is the alphabet size, the latter is asymptotically at least as fast as a linear time algorithm which runs on the uncompressed string when $\sigma$ is constant, and can be more efficient when the text is compressible, i.e. when $m$ and $n$ are small.Comment: SPIRE 201