• Molecular & Cellular Toxicology
• /
• v.1 no.3
• /
• pp.172-178
• /
• 2005

[ $21{\alpha}$ ]- and ${\beta}$-Methylmelianodiol were isolated as the inhibitor of IL-5 bioactivity from Poncirus tripoliata. To develope as an anti-septic drug, the genotoxicity of $21{\alpha}\;-and\;{\beta}-methylmelianodiol$ was subjected to high throughput toxicity screening (HTTS) because they revealed strong IL-5 inhibitory activity and limitation of quantity. Mouse lymphoma thymidine kinase ($tk^{+/-}$) gene assay (MOLY), single cell gel electrophoresis (Comet) assay in mammalian cells and Ames reverse mutation assay in bacterial system were used as simplified, inexpensive, short-term in vitro screening tests in our laboratory. These compounds are not mutagenic in S. typhimurium TA98 and TA100 strains both in the presence and absence of metabolic activation. Before performing the comet assay, $IC_{20}$ of $21{\alpha}-methylmelianodiol$ was determined the concentration of $25.51\;{\mu}g/mL\;and\;21.99\;{\mu}g/mL$ with and without S-9, respectively. Also $21{\beta}-methylmelianodiol$ was determined the concentration of $24.15\;{\mu}g/mL\;and\;\;22.46\;{\mu}g/mL$ with and without S-9, respectively. In the comet assay, DNA damage was not observed both $21{\alpha}-methylmelianodiol\;and\;21{\beta}-methylmelianodiol$ in mouse lymphoma cell line. Also, the mutant frequencies in the treated cultures were similar to the vehicle controls, and none of $21{\alpha}\;-and\;{\beta}-methylmelianodiol$ with and without S-9 doses induced a mutant frequency over. twice the background. It is suggests that $21{\alpha}\;-and\;{\beta}-methylmelianodiol$ are non-mutagenic in MOLY assay. The results of this battery of assays indicate that $21{\alpha}\;-and\;{\beta}-methylmelianodiol$ have no genotoxic potential in bacterial or mammalian cell systems. Therefore, we suggest that $21{\alpha}\;-and\;{\beta}-methylmelianodiol$, as the optimal candidates with both no genotoxic potential and IL-5 inhibitory effects must be chosen.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.381-392
• /
• 2013

During the last decade, the multitude of advances attained in terminal computers, along with the introduction of mobile hand-held devices, and the deployment of high speed networks have led to a recent surge of interest in Quality of Service (QoS) for video applications. The main difficulty is that mobile devices experience disparate channel conditions, which results in different rates and patterns of packet loss. One way of making more efficient use of network resources in video services over wireless channels with heterogeneous characteristics to heterogeneous types of mobile device is to use a scalable video coding (SVC). An SVC divides a video stream into a base layer and a single or multiple enhancement layers. We have to ensure that the base layer of the video stream is successfully received and decoded by the subscribers, because it provides the basis for the subsequent decoding of the enhancement layer(s). At the same time, a system should be designed so that the enhancement layer(s) can be successfully decoded by as many users as possible, so that the average QoS is as high as possible. To accommodate these characteristics, we propose an efficient transmission scheme which incorporates SVC-aware dual-channel repetition to improve the perceived quality of services. We repeat the base-layer data over two channels, with different characteristics, to exploit transmission diversity. On the other hand, those channels are utilized to increase the data rate of enhancement layer data. This arrangement reduces service disruption under poor channel conditions by protecting the data that is more important to video decoding. Simulations show that our scheme safeguards the important packets and improves perceived video quality at a mobile device.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1195-1206
• /
• 2015

For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.307-319
• /
• 2015

Current ontology studies use the Hadoop distributed storage framework to perform map-reduce algorithm-based reasoning for scalable ontologies. In this paper, however, we propose a novel approach for scalable Web Ontology Language (OWL) Horst Lite ontology reasoning, based on distributed cluster memories. Rule-based reasoning, which is frequently used for scalable ontologies, iteratively executes triple-format ontology rules, until the inferred data no longer exists. Therefore, when the scalable ontology reasoning is performed on computer hard drives, the ontology reasoner suffers from performance limitations. In order to overcome this drawback, we propose an approach that loads the ontologies into distributed cluster memories, using Spark (a memory-based distributed computing framework), which executes the ontology reasoning. In order to implement an appropriate OWL Horst Lite ontology reasoning system on Spark, our method divides the scalable ontologies into blocks, loads each block into the cluster nodes, and subsequently handles the data in the distributed memories. We used the Lehigh University Benchmark, which is used to evaluate ontology inference and search speed, to experimentally evaluate the methods suggested in this paper, which we applied to LUBM8000 (1.1 billion triples, 155 gigabytes). When compared with WebPIE, a representative mapreduce algorithm-based scalable ontology reasoner, the proposed approach showed a throughput improvement of 320% (62k/s) over WebPIE (19k/s).

• BMB Reports
• /
• v.30 no.5
• /
• pp.303-307
• /
• 1997

Grb2, which is composed of a Src homology 2 (SH2) domain and two Src homology 3 (SH3) domains, is known to serve as an adaptor protein in signaling for Ras activation. Thus, a blocker of the Grb2 interactions with other proteins can be a potential candidate for an anticancer drug. In this study, we have developed a high throughput screening method for SH3 domain binding ligands and blockers. Firstly, we made and purified the glutathione S-transferase (GST)-fusion proteins with the Grb2 SH2 and SH3 domains, and the entire Grb2. This method measures the binding of a biotin-labeled oligopeptide, derived from a Grb2/SH3 binding motif in the hSos, to the GST-fusion proteins, which are precoated as glutathione S-transferase fusion protein on a solid phase. When $1\;{\mu}g$ of each fusion protein was used to coat the wells, both N- and C- terminal SH3 the domains as well as the whole of Grb2 were able to interact with the biotin-conjugated ligand peptide, while the SH2 domain and GST alone showed no binding affinity. Although N- and C- terminal SH3 domains showed an increase of binding to the ligand peptide in proportion to the amount of peptide, the GST fusion protein with Grb2 demonstrated much higher binding affinity. GST-Grb2 coating on the solid phase showed a saturation curve; 66 and 84% of the maximal binding was observed at 100 and 300 ng/$100\;{\mu}l$, respectively. This binding assay system was peptide sequence-specific, showing a dose-dependent inhibition with the unlabeled peptide of SH3 binding motif. Several other peptides, such as SH2 domain binding motifs and PTB domain binding motif, were ineffective to inhibit the binding to the biotin-conjugated ligand peptide. These results suggest that our method may be useful to screen for new anticancer drug candidates which can block the signaling pathways mediated by SH3 domain binding.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.121-128
• /
• 2005

Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.154-167
• /
• 2006

Today's IEEE 802.11 WLANs(Wireless LANs) provide multiple transmission rates so that different rates can be exploited in an adaptive manner depending on the underlying channel condition in order to maximize the system performance. Many rate adaptation schemes have been proposed so far while most(if not all) of the commercial devices implement a simple open-loop rate adaptation scheme(i.e., without feedback from the receiver), called ARF(Automatic Rate Fallback) due to its simplicity. A key problem with such open-loop rate adaptation schemes is that they do not consider the collision effect, and hence, malfunction severely when many transmission failures are due to collisions. In this paper, we propose a novel rate-adaptation scheme, called CARA(Collision-Aware Rate Adaptation). The key idea of CARA is that the transmitter station combines adaptively the Request-to-Send/Clear-to-Send(RTS/CTS) exchange with the Clear Channel Assessment(CCA) functionality to differentiate frame collisions from frame transmission failures cause by channel errors. Therefore, compared with other open-loop rate adaptation schemes, CATA is more likely to make the correct rate adaptation decisions. Through extensive simulation runs, we evaluate our proposed scheme to show that our scheme yields significantly higher throughput performance than the existing schemes in both static and time-varying fading channel environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1A
• /
• pp.93-98
• /
• 2004

Serial ATA interface Is inexpensive comparatively and performance is superior. So it is suitable technology in demand that now require data transmission and throughput of high speed. This paper describes a design and implementation of Serial ATA Link layer about error detection and 8b/10b encoder/decoder for DC balance in frequency 150MHz. The 8b/10b Encoder is partitioned into a 5b/6b plus a 3b/4b coder. The logical model of the block is described by using Verilog HDL at register transistor level and the verified HDL is synthesized using standard cell libraries. And it is fabricated with $0.35{\mu}m$ Standard CMOS Cell library and the chip size is about $1500{\mu}m\;*\;1500{\mu}m$. The function of this chip has been verified and tested using testboard with FPGA equipment and IDEC ATS2 test equipment. It is used to frequency of 100MHz in verification processes and supply voltage 3.3V. The result of testing is well on the system clock 100MHz. The designed and verified each blocks may be used IP in the field of high speed serial data communication.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.3-11
• /
• 2016

In the environment of Internet of Things (IoT), IoT devices are limited by physical components such as power supply and memory, and also limited to their network performance in bandwidth, wireless channel, throughput, payload, etc. Despite these limitations, resources of IoT devices are shared with other IoT devices. Especially, remote management of the information of devices and patients are very important for the IoT healthcare service, moreover, providing the interoperability between the healthcare device and healthcare platform is essential. To meet these requirements, format of the message and the expressions for the data information and data transmission need to comply with suitable international standards for the IoT environment. However, the ISO/IEEE 11073 PHD (Personal Healthcare Device) standards, the existing international standards for the transmission of health informatics, does not consider the IoT environment, and therefore it is difficult to be applied for the IoT healthcare service. For this matter, we have designed and implemented the IoT healthcare system by applying the oneM2M, standards for the Internet of Things, and ISO/IEEE 11073 DIM (Domain Information Model), standards for the transmission of health informatics. For the implementation, the OM2M platform, which is based on the oneM2M standards, has been used. To evaluate the efficiency of transfer syntaxes between the healthcare device and OM2M platform, we have implemented comparative performance evaluation between HTTP and CoAP, and also between XML and JSON by comparing the packet size and number of packets in one transaction.