• Journal of the Korea Society of Computer and Information
• /
• 제24권3호
• /
• pp.41-47
• /
• 2019

In this paper, we propose a application of conditional generative adversarial network (cGAN) for generation of contrast enhanced computed tomography (CT) image. Two types of CT data which were the enhanced and non-enhanced were used and applied by the histogram equalization for adjusting image intensities. In order to validate the generation of contrast enhanced CT data, the structural similarity index measurement (SSIM) was performed. Prepared generated contrast CT data were analyzed the statistical analysis using paired sample t-test. In order to apply the optimized algorithm for the lymph node cancer, they were calculated by short to long axis ratio (S/L) method. In the case of the model trained with CT data and their histogram equalized SSIM were $0.905{\pm}0.048$ and $0.908{\pm}0.047$. The tumor S/L of generated contrast enhanced CT data were validated similar to the ground truth when they were compared to scanned contrast enhanced CT data. It is expected that advantages of Generated contrast enhanced CT data based on deep learning are a cost-effective and less radiation exposure as well as further anatomical information with non-enhanced CT data.

• The KIPS Transactions:PartD
• /
• 제19D권3호
• /
• pp.229-236
• /
• 2012

The demand for map applications in both Web and mobile environments has been rapidly increased with the population of Web and smart phone usage. Web-based map applications are mostly developed on such environments as ArcGIS and MapServer and mobile map applications are developed on such API levels as Google Maps and Yahoo Maps. But many parts of map applications are still constructed by coding because these environments don't support high level of automation. Our MapAppGen that we have designed and implemented enhances the Web-based map application productivity by generating the map related modules that can be applied to the Drupal that is one of popular content management systems(CMS's). Comparing the applications that are constructed by the Drupal-supported GMap or NodeMap, the applications that are constructed by MapAppGen provide information on not only the interested geographical feature but also its related geographical features. MapAppGen uses Google Maps API and Drupal is a module-based system that supports the creation, composition and management of contents. We are now working on automatic generation of mobile map applications with MapAppGen.

• Journal of the Korean Institute of Telematics and Electronics
• /
• 제19권6호
• /
• pp.1-8
• /
• 1982

In this paper a new analytic method for Ladder networks by weighted tree is proposed. In contrast to conventional tree concept that represents only information structure, in this paper, a tree with hierarchical structure is established by giving wei체t of impedance Z and admittance Y to branch and representing each node of its branch as a pair of voltage and current. Then, by defining generation level from tree structure and by parsing between standand level and arbitrary level, driving point impedance, transfer function and transfer impedance are simultaneously obtained instead of complex calculation method by inspection. The validity of this method is proved by the reciprocal theorem and this method is applied to four-terminal constants and the feedback network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제17권3호
• /
• pp.63-69
• /
• 2017

In next generation satellite broadcasting system, requirement of high throughput efficiency has been increasing continuously. To increase throughput efficiency and improve bit error performance simultaneously, FTN method and LDPC codes are employed in new sattelite standard, DVB-S3 system. This paper considered three kinds of methods for increase throughput efficiency. Firstly, as conventional one, high coding rate parity matrix in LDPC encoder is considered. Secondly, punctured coding scheme which delete the coded symbols according to appropriate rules is considered. Lastly, FTN method which transmit fater than Nyquist rate is considered. Among of three kinds of methods, FTN method is most efficient in aspect to performance while maintain same throughput efficiency.

• Asian Pacific Journal of Cancer Prevention
• /
• 제15권8호
• /
• pp.3747-3752
• /
• 2014

Background: Gallbladder carcinoma (GBC) is the most common carcinoma of the biliary system. Among its research models, orthotopic xenograft models, important research tools, have been rarely reported in the literature however. Aim: To explore establishment of an orthotopic xenograft model and to evaluate the advantage and disadvantage as compared with other models. Materials and Methods: Subcutaneous xenograft and orthotopic xenograft models of gallbladder carcinoma in nude mice were established and compared with human gallbladder carcinomas. Results: For the orthotopic xenograft model and clinical gallbladder carcinomas, the lymph node metastatic rates were 69.2% and 53.3% (p>0.05); ascites generation rates, 38.5% and 11.7%(p<0.05); liver invasive rates, 100% and 61.7%(p<0.05); and lymphatic vessel densities (LVD), $10.4{\pm}3.02$ and $8.77{\pm}2.92$ (p>0.05), respectively. In the subcutaneous xenograft model, no evidence of ascites generation, lymph node metastasis and liver metastasis were found, and its LVD was lower ($4.56{\pm}1.53$, p<0.05). Conclusions: Compared with the subcutaneous xenograft model, the orthotopic xenograft model better simulates clinical gallbladder carcinoma in terms of metastasis and invasion, which may be attributed to the difference in microenvironment and LVD.

• Journal of Information Processing Systems
• /
• 제5권1호
• /
• pp.33-40
• /
• 2009

Ever since the network-based malicious code commonly known as a 'worm' surfaced in the early part of the 1980's, its prevalence has grown more and more. The RCS (Random Constant Spreading) worm has become a dominant, malicious virus in recent computer networking circles. The worm retards the availability of an overall network by exhausting resources such as CPU capacity, network peripherals and transfer bandwidth, causing damage to an uninfected system as well as an infected system. The generation and spreading cycle of these worms progress rapidly. The existing studies to counter malicious code have studied the Microscopic Model for detecting worm generation based on some specific pattern or sign of attack, thus preventing its spread by countering the worm directly on detection. However, due to zero-day threat actualization, rapid spreading of the RCS worm and reduction of survival time, securing a security model to ensure the survivability of the network became an urgent problem that the existing solution-oriented security measures did not address. This paper analyzes the recently studied efficient dynamic network. Essentially, this paper suggests a model that dynamically controls the RCS worm using the characteristics of Power-Law and depth distribution of the delivery node, which is commonly seen in preferential growth networks. Moreover, we suggest a model that dynamically controls the spread of the worm using information about the depth distribution of delivery. We also verified via simulation that the load for each node was minimized at an optimal depth to effectively restrain the spread of the worm.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제21권2호
• /
• pp.268-275
• /
• 2011

This paper proposes two optimal path planning methods of a mobile robot using uDEAS (univariate Dynamic Encoding Algorithm for Searches). Before start of autonomous traveling, a self-controlled mobile robot must generate an optimal global path as soon as possible. To this end, numerical optimization method is applied to real time path generation of a mobile robot with an obstacle avoidance scheme and the basic path generation method based on the concept of knot and node points between start and goal points. The first improvement in the present work is to generate diagonal paths using three node points in the basic path. The second innovation is to make a smooth path plotted with the blending polynomial using uDEAS. Effectiveness of the proposed schemes are validated for several environments through simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2002년도 추계종합학술대회
• /
• pp.826-834
• /
• 2002

Asynchronous third generation mobile communication system is able to service Packet Switching through adding GPRS Network to the second generation system GSM. Therefore, it is necessary to study packet traffic service of GGSN node which is due to perform gateway role that GPRS Network is enable to inter-connect with Internet in order to optimize the capability and performance of GGSN. In this paper, the Internet packet traffic model that it is arrived to GGSN node from the Internet is studied and In order to process the Inter traffic efficiently, performance analysis model in GGSN is proposed to optimize packet processing capability of each processor. In order to guarantee QoS requirement of the real time traffic Speech and Video, several scheduling algorithm is applied to performance model and each mechanism is compared with several performance parameters.

• Journal of the Korea Society of Computer and Information
• /
• 제27권9호
• /
• pp.113-120
• /
• 2022

In this paper, we analyze the feasibility of the IP spoofing attack exploiting null security algorithms in 5G networks based on 3GPP standard specifications. According to 3GPP standard specifications, the initial Registration Request message is not protected by encryption and integrity. The IP spoofing attack exploits the vulnerability that allows a malicious gNB (next generation Node B) to modify the contents of the initial Registration Request message of a victim UE (User Equipment) before forwarding it to AMF (Access and Mobility Management Function). If the attack succeeds, the victim UE is disconnected from the 5G network and a malicious UE gets Internet services, while the 5G operator will charge the victim UE. In this paper, we analyze the feasibility of the IP spoofing attack by analyzing whether each signaling message composing the attack conforms to the 3GPP Rel-17 standard specifications. As a result of the analysis, it is determined that the IP spoofing attack is not feasible in the 5G system implemented according to the 3GPP Rel-17 standard specifications.

• The KIPS Transactions:PartD
• /
• 제15D권6호
• /
• pp.755-766
• /
• 2008

Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.