• 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.

• Journal of Life Science
• /
• v.25 no.7
• /
• pp.833-838
• /
• 2015

Multidrug-resistant super bacterial, fungal, viral, and parasitic infections are major health threaten pathogens. However, to overcome the present healthcare situation, among the leading alternatives to current drugs are antimicrobial peptides (AMPs), which are abundantly produced via various species in nature. AMPs, small host defense proteins, are in charge of the innate immunity for the protection of multicellular organisms such as fish, amphibian, reptile, plants and animals from infection. The number of AMPs identified per year has increased steadily since the 1980s. Over 2,000 natural AMPs from bacteria, protozoa, fungi, plants, and animals have been listed into the antimicrobial peptide database (APD). The majority of these AMPs (>86%) possess 11–50 amino acids with a net charge from 0 to +7 and hydrophobic percentages between 31–70%. This report classified AMP into several categories including biological source, biological functions, peptide properties, covalent bonding pattern, and 3D structure. AMP functions not only antimicrobial activity but facilitates cell biological activity such as chemotatic activity. In addition, fibroblastic reticular cell (FRC) originated from mouse lymph node stroma induced the expression of AMP in inflammatory condition. AMP induced from FRC contained whey acidic protein (WAP) domain. It suggests that the classification of AMP will be done by protein domain.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.339-344
• /
• 2006

Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

• 한국벤처창업학회:학술대회논문집
• /
• 2010.08a
• /
• pp.71-89
• /
• 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 tree building problem 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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.1-6
• /
• 2017

Recent researches on radio frequency energy harvesting networks(RF-EHNs) with limited energy resource like battery have been focusing on the development of a new scheme that can effectively extend the whole lifetime of a network to semipermanent. In order for considerable increase both in the amount of energy obtained from radio frequency energy harvesting and its charging effectiveness, it is very important to design a network that supports energy harvesting and data transfer simultaneously with the full consideration of various characteristics affecting the performance of a RF-EHN. In this paper, we proposes an interference-based charging aware routing protocol(ICARP) that utilizes interference information and charging time to maximize the amount of energy harvesting and to minimize the end-to-end delay from a source to the given destination node. To accomplish the research objectives, this paper gives a design of ICARP adopting new network metrics such as interference information and charging time to minimize end-to-end delay in energy harvesting wireless networks. The proposed method enables a RF-EHN to reduce the number of packet losses and retransmissions significantly for better energy consumption. Finally, simulation results show that the network performance in the aspects of packet transmission rate and end-to-end delay has enhanced with the comparison of existing routing protocols.

• Journal of Radiation Industry
• /
• v.6 no.1
• /
• pp.31-40
• /
• 2012

There are two methods to fabricate the readout electronic to a large-area CMOS image sensor (LACIS). One is to design and manufacture the sensor part and signal processing electronics in a single chip and the other is to integrate both parts with bump bonding or wire bonding after manufacturing both parts separately. The latter method has an advantage of the high yield because the optimized and specialized fabrication process can be chosen in designing and manufacturing each part. In this paper, LACIS chip, that is optimized design for the latter method of fabrication, is presented. The LACIS chip consists of a 3-TR pixel photodiode array, row driver (or called as a gate driver) circuit, and bonding pads to the external readout ICs. Among 4 types of the photodiode structure available in a standard CMOS process, $N_{photo}/P_{epi}$ type photodiode showed the highest quantum efficiency in the simulation study, though it requires one additional mask to control the doping concentration of $N_{photo}$ layer. The optimized channel widths and lengths of 3 pixel transistors are also determined by simulation. The select transistor is not significantly affected by channel length and width. But source follower transistor is strongly influenced by length and width. In row driver, to reduce signal time delay by high capacitance at output node, three stage inverter drivers are used. And channel width of the inverter driver increases gradually in each step. The sensor has very long metal wire that is about 170 mm. The repeater consisted of inverters is applied proper amount of pixel rows. It can help to reduce the long metal-line delay.