• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.131-140
• /
• 2013

This paper deals with the design and implementation of an interface for interoperation between DiskSim, a well-known disk simulator, and a system-level simulator based on DEVSim++. Such inter-operational simulation aims at evaluation of an overall performance of storage systems which consist of multiple computer nodes with a variety of I/O level specifications. A well-known system-level simulation framework, DEVSim++ environment is based on the DEVS formalism, which provides a sound semantics of modular and hierarchical modeling methodology at the discrete event systems level such as multi-node computer systems. For maintainability we assume that there is no change of the source codes for two heterogeneous simulation engines. Thus, we adopt a notion of simulators interoperation in which there should be a means to synchronize simulation times as well as to exchange messages between simulators. As an interface for such interoperation DiskSimManager is designed and implemented. Various experiments, comparing the results of the standalone DiskSim simulation and the interoperation simulation using the proposed interface of DiskSimManager, proved that DiskSimManager works correctly as an interface for interoperation between DEVSim++ and DiskSim.

• Journal of Bio-Environment Control
• /
• v.18 no.4
• /
• pp.370-376
• /
• 2009

To produce uniform seedlings of tomato and cucumber with inexpensive way, their seedling quality by different light sources was investigated. The raising of seedling was performed by red LED (light emitting diodes), blue LED, red-blue mixed LED or fluorescent light with a fixed PPF(photosynthetic proton flux) level, about $40{\sim}60{\mu}mol{\cdot}m^{-2}{\cdot}sec^{-1}$. In the both tomato and cucumber, the rapid extension of hypocotyledonary axis was observed in Blue LED than fluorescent light, but opposite result was found in Red and mixed LED. During the nursery period of tomato and cucumber, the fresh weight was the highest in Red LED as 74% increasement in tomato and 74% in cucumber. In the case of seedling quality after the tomato nursery, there was no difference in the positions of 1st flower cluster and the number of bearing-flower per flower cluster by each light source. In case of cucumber, until 20th node, the setting ratio of female flower was higher in LED than fluorescent treatment, and also more healthy fruit setting was found in LED. Therefore, we assume that the Red or mixed (Red 2 + Blue 1) LED is more favorable to produce high quality tomato and cucumber seedlings in closed nursery facility.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.218-225
• /
• 2007

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.69-78
• /
• 2006

In the field of the bioinformatics, it plays an important role in predicting functional information or structure information to search similar sequence in biological DB. Biolrgical sequences have been increased dramatically since Human Genome Project. At this point, because the searching speed for the similar sequence is highly regarded as the important factor for predicting function or structure, the SMP(Sysmmetric Multi-Processors) computer or cluster is being used in order to improve the performance of searching time. As the method to improve the searching time of BLAST(Basic Local Alighment Search Tool) being used for the similarity sequence search, We suggest the nBLAST algorithm performing on the cluster environment in this paper. As the nBLAST uses the MPI(Message Passing Interface), the parallel library without modifying the existing BLAST source code, to distribute the query to each node and make it performed in parallel, it is possible to easily make BLAST parallel without complicated procedures such as the configuration. In addition, with the experiment performing the nBLAST in the 28 nodes of LINUX cluster, the enhanced performance according to the increase in the number of the nodes has been confirmed.

• Asian Pacific Journal of Cancer Prevention
• /
• v.13 no.4
• /
• pp.1457-1461
• /
• 2012

Purpose: Non small cell lung cancer (NSCLC) is the leading worldwide source of cancer-related deaths. Although some drugs targeting EGFR mutations have been developed, most advanced cases are still incurable. New targets for anticancer drugs are demanded. The kringle 1 domain of hepatocellular growth factor alpha chain (HGFK1) is a potent anti-angiogenesis factor. It has also emerged as a potential anticancer factor in hepatocellular carcinoma (HCC). The expression of HGFK1 protein in patients with NSCLC has not been reported to date. Method: Here, we assessed HGFK1 expression by Western blotting in 103 cases with advanced NSCLC to investigate the impact of HGFK1 on survival. Results: Results revealed 33 (30.1%) patients were classified as high expressors, this being significantly associated with less remote metastasis (P = 0.002) but not with lymph node metastasis (P = 0.062). There was also a significant association between HGFK1 expression and tumor size (P = 0.025) as well as clinical stage (P = 0.012). Kaplan-Meier survival analysis showed that both overall survival (OS) and progression free survival (PFS) of patients with HGFK1 expression were longer than those of patients without HGFK1 expression (P = 0.004 and P = 0.001 respectively). HGFK1 reversed gefitinib inhibition in the resistent NSCLC cell line A431/GR but did not inhibit the proliferation of NSCLC cells A431 and A431/GR directly. Reversion of gefitinib inhibition in A431/GR cells by HGFK1 was related to decreased phosphorylation of ERK and STAT5. Conclusions: HGFK1 may be a useful prognostic factor of advanced NSCLC patients and a potential drug for gefitinib resistant patients.

• Journal of the Korean Geographical Society
• /
• v.39 no.5 s.104
• /
• pp.804-818
• /
• 2004

As spatial data resources become more abundant, the potential for conflict among them increases. Those conflicts can exist between two or many spatial datasets covering the same area and categories. Therefore, it becomes increasingly important to be able to effectively relate these spatial data sources with others then create new spatial datasets with matching geometry and topology. One extensive spatial dataset is US Census Bureau's TIGER file, which includes census tracts, block groups, and blocks. At present, however, census maps often carry information that conflicts with municipally-maintained detailed spatial information. Therefore, in order to fully utilize census maps and their valuable demographic and economic information, the locational information of the census maps must be reconciled with the more accurate municipally-maintained reference maps and imagery. This paper formulates a conceptual framework and two map models of map conflation to make geometrically and topologically consistent source maps according to the reference maps. The first model is based on the cell model of map in which a map is a cell complex consisting of 0-cells, 1-cells, and 2-cells. The second map model is based on a different set of primitive objects that remain homeomorphic even after map generalization. A new hierarchical based map conflation is also presented to be incorporated with physical, logical, and mathematical boundary and to reduce the complexity and computational load. Map conflation principles with iteration are formulated and census maps are used as a conflation example. They consist of attribute embedding, find meaning node, cartographic 0-cell match, cartographic 1-cell match, and map transformation.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.5 no.3
• /
• pp.27-45
• /
• 2010

It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.57 no.2
• /
• pp.132-136
• /
• 2012

Kenaf (Hibiscus cannabinus) is an annual herbaceous plant of the family Malvacease that has been planted in tropical Africa and Asia region for more than 4000 years and use as source of fiber, energy and feed stock. In this study, the physiological characters and chemical compositions of kenaf mutant variety "Jangdae" developed using gamma irradiation at the Korea Atomic Energy Research Institute (KAERI) were compared with three genetic resources (Auxu, C12, and C14-DRS). Jangdae showed the highest productivity growth rates in fresh yield, dry weight (DW) yield (leaf and stem), node number, and stem thickness. Especially, leaf DW yield of Jangdae was 1.6-3.1 times higher than that of three genetic resources. Also, stem DW yield of Jangdae was 1.6-2.1 times higher than that of three genetic resources. In the analysis of chemical composition, Jangdae showed 16.9% of crude protein content that was 0.86-0.94 times lower than three cultivars. However, Jangdae showed the highest neutral detergent fiber (NDF) contents in leaf (32.5%) and stem (75.2%). Also, acid detergent fiber (ADF) contents of stem and leaf in Jangdae were 64.4% and 33.9%, respectively. Total polyphenol and total flavonoid contents were 22.1 mg/g and 7.4 mg/g in Jangdae. Based on these results, Jangdae would have the potential to become a successful forage crop.