著者
Hatakeyama Tomomitsu Himeshima Tomoharu Komatsu Akane Yamasaki Nobuyuki
出版者
社団法人日本農芸化学会
雑誌
Bioscience, Biotechnology, and Biochemistry (ISSN:09168451)
巻号頁・発行日
vol.57, no.10, pp.1736-1739, 1993-10-23
被引用文献数
2 15

Two Ca^<2+>-dependent lectins were purified from the sea cucumber Stichopus japonicus by affinity chromatography on lactosyl-Sepharose 4B and ion-exchange chromatography on Q-Sepharose. Their molecular masses were estimated to be 13 kDa (SJL-I) and 15 kDa (SJL-II) on SDS-PAGE. SJL-I agglutinated rabbit erythrocytes as well as human A, B, and O-type erythrocytes, but SJL-II agglutinated only rabbit erythrocytes. Hemagglutination by SJL-I was competitively inhibited by N-acetyl-D-galactosamine and galactose-containing carbohydrates. On the other hand, only lactose, melibiose, and raffinose gave weak inhibition of hemagglutination by SJL-II, suggesting that SJL-II may have high specificity for particular complex carbohydrate(s) on the surface of rabbit erythrocytes. SJL-II was activated at ten times lower Ca^<2+> concentration than SJL-I. Both lectins lost activity in acidic pH, while SJL-I appeared more stable down to pH 4.5.
著者
KOBAYASHI Hidenori YAMASAKI Nobuyuki
出版者
一般社団法人電子情報通信学会
雑誌
IEICE transactions on information and systems (ISSN:09168532)
巻号頁・発行日
vol.86, no.10, pp.2040-2048, 2003-10-01
参考文献数
16
被引用文献数
7

The imprecise computation model is one of the flexible computation models used to construct real-time systems It is especially useful when the worst case execution times are difficult to estimate or the execution times vary widely. Although there are several ways to implement this model, they have not attained much attentions of real-world application programmers to date due to their unrealistic assumptions and high dependency on the execution environment In this paper, we present an integrated approach for implementing the imprecise computation model. In particular, our research covers three aspects First, we present a new imprecise computation model which consists of a mandatory part, an optional part, and another mandatory part called wind-up part This wind-up part allows application programmers to explicitly incorporate into their programs the exact operations needed for safe degradation of performance when there is a shortage in resources. Second, we describe a scheduling algorithm called Mandatory-First with Wind-up Part (M-FWP) which is based on the Earliest Deadline First strategy This algorithm, unlike scheduling algorithms developed for the classical imprecise computation model, is capable of scheduling a mandatory portion after an optional portion. Third, we present a dynamic priority server method for an efficient implementation of the M-FWP algorithm We also show that the number of the proposed server at most needed per node is one In order to estimate the performance of the proposed approach, we have implemented a real-time operating system called RT-Frontier. The experimental analyses have proven its ability to implement tasks based on the imprecise computation model without requiring any knowledge on the execution time of the optional part Moreover, it also showed performance gam over the traditional checkpointing technique.